GELFOND, M. AND LEONE, N. 2002. Logic programming and knowledge representation
- the A-Prolog perspective. Artificial Intelligence 138, 1-2, 3-38 GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP 1988), R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 10 70-10 80.

GIUNCHIGLIA, E., LIERLER, Y., AND MARATEA, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36 , 4, 345–377.

GIUNCHIGLIA, E. AND MARATEA, M. 2005. On the relation between answer set and SAT
procedures (or, between CMODELS and SMODELS). In Proceedings of the 21st International Conference on Logic Programming (ICLP 2005), M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol. 3668. Springer, 3 7–51.

HAI, L., JIGUI, S., AND YIMIN, Z. 2003. Theorem proving based on the extension rule.

Journal of Automated Reasononing 31, 1, 11-21.

HAKEN, A. 1985. The intractability of resolution. Theoretical Computer Science 39, 2–3, 29 7-308 JANHUNEN, T. 2006. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16, 1-2, 35-86.

JARVISALO, M. AND JUNTTILA, T. 2008. Limitations of restricted branching in clause learning. Constraints, in press.

J A RVISALO, M. AND O IKARINEN, E. 2007. Extended ASP tableaux and rule redundancy in normal logic programs. In Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, 134-148.

LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S., AND SCAR-
CELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM
Transactions on Computational Logic 7, 3, 499-562.

Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138, 1-2, 39-54.

LIFSCHITZ, V. AND RAZBOROV, A. 2006. Why are there so many loop formulas? ACM
Transactions on Computational Logic 7, 2, 261-268.

LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. In Proceedings of the 1th International Conference on Logic Programming, P. V. Hentenryck, Ed. MIT Press, 23-37.

LIN, F. AND ZHAO, J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), G. Gottlob and T. Walsh, Eds. Morgan Kaufmann, 853-858.

L IN , F. AND Z HAO , Y. 2004. A SSAT: Computing answer sets of a logic program by SAT
solvers. Artificial Intelligence 157, 1-2, 115-137.

MAREK, V. W. AND TRUSZCZYNSKI, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25 Year Perspective, K. R. Apt, V. W. Marek, M. Truszczy´nski, and D. S. Warren, Eds. Springer, 375–398.

MOSKEWICZ, M. W., MADIGAN, C. F., ZHAO, Y., ZHANG, L., AND MALIK, S. 2001.

Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001). ACM, 530–535.

NIEMELĂ, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3-4, 241-273.

NOGUEIRA, M., BALDUCCINI, M., GELFOND, M., WATSON, R., AND BARRY, M. 2001.

An A-Prolog decision support system for the space shuttle. In Proceedings of the Srd