1. K. R. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19-20:9–71, 1994. 268, 271
2. Piero A. Bonatti. Resoning with infinite stable models. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, August 2001. 268
3. Paweł Cholewiński, Victor W. Marek, and Miroslaw Truszczyński. Default reasoning system DeReS. In Luigia Carlucci Aiello, Jon Doyle, and Stuart Shapiro, editors, KR’96: Principles of Knowledge Representation and Reasoning, pages 518–528. Morgan Kaufmann, San Francisco, California, 1996. 267
4. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. Complexity and expressive power of logic programming. In Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, pages 82–101, Ulm, Germany, June 1997. IEEE Computer Society Press. 268, 274, 276
5. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 3:267–284, 1984. 276