Karp, C. **Languages with Expressions of Infinitary length**. North-Holland, Amsterdam, 1964.

Lifschitz, V. Twelve definitions of a stable model. In: **Proceedings of International Conference on Logic Programming**, pages 37–51, 2008.

Lifschitz, V., Pearce, D. and Valverde, A. Strongly equivalent logic programs. ACM
Transactions on computational logic 2:526–541, 2001.

Lifschitz, V. and Razborov. A. Why are there so many loop formulas. **Annals of Mathematics and Artificial Intelligence 7**:261–268, 2006.

Lin, F. and Zhao, Y. ASSAT: Computing answer sets of a logic program by SAT solvers.

Proceedings of AAAI 2002, pages 112–117. 2002.

Marek, V.W. and Remmel, J.B. An Application of Proof-theory in Answer Set Programming. Preliminary version at arXiv:0905.4076, 2010.

Marek, V.W., and Truszczynski, M. ´ Stable Models and an Alternative Logic Programming Paradigm. **The Logic Programming Paradigm**, pp. 375–398. Series Artificial Intelligence, Springer-Verlag, 1999.

Niemela, I. ¨ Logic programs with stable model semantics as a constraint programming paradigm. **Annals of Mathematics and Artificial Intelligence 25,** 3,4, 241–273, 1999 Truszczynski, M. Strong and Uniform Equivalence of Nonmonotonic Theories An algebraic Approach. **Proceedings of the Conference on Principles of Knowledge Representation and Reasoning**, pages 389–399, 2006.