Koch, C., Leone, N., and Pfeifer, G. 2003. Enhancing disjunctive logic programming systems by SAT checkers. **Artificial Intelligence 151**, 177–212.

Lee, J. 2004. Nondefinite vs. definite causal theories. In **Proceedings of the Seventh**
International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04). 141–153.

Lee, J. 2005. A model-theoretic counterpart of loop formulas. In **Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05)**. Professional Book Center, 503–508.

Lee, J. and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Proceedings of Nineteenth International Conference on Logic Programming (ICLP'03). 451–465.

Lee, J. and Lin, F. 2006. Loop formulas for circumscription. **Artificial Intelligence 170,** 2, 160–185.

Lee, J. and Meng, Y. 2008. On loop formulas with variables. In **Proceedings of**
the Eleventh International Conference on Knowledge Representation and Reasoning (KR'08). 444–453.

Lee, J. and Meng, Y. 2009. On reductive semantics of aggregates in answer set programming. In **Procedings of the Tenth International Conference on Logic Programming**
and Nonmonotonic Reasoning (LPNMR'09). 182–195.

Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., and Scarcello, F. 2006. The dlv system for knowledge representation and reasoning. ACM
Transactions on Computational Logic 7, 3.

Leone, N., Rullo, P., and Scarcello, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. **Information and Computation 135(2)**, 69– 112.

Lierler, Y. 2005. cmodels: SAT-based disjunctive answer set solver. In **Proceedings of**
the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05). 447–452.

Lifschitz, V., Tang, L. R., and Turner, H. 1999. Nested expressions in logic programs.

Annals of Mathematics and Artificial Intelligence 25, 369–389.

Lifschitz, V. and Razborov, A. 2006. Why are there so many loop formulas? ACM
Transactions on Computational Logic 7, 2, 261–268.

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 Eighteenth International**
Joint Conference on Artificial Intelligence (IJCAI'03). 853–858.

Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT
solvers. **Artificial Intelligence 157**, 115–137.

Liu, L. and Truszczynski, M. 2006. Properties and applications of programs with monotone and convex constraints. **Journal of Artificial Intelligence Research 27**, 299–
334.

Sacca, D. and Zaniolo, C. ´ 1990. Stable models and non-determinism in logic programs with negation. In **Proceedings of the Ninth ACM Symposium on Principles of Database** Systems (PODS). 205–217.

You, J.-H. and Liu, G. 2008. Loop formulas for logic programs with arbitrary constraint atoms. In **Proceedings of the Twenty-third AAAI Conference on Artificial Intelligence**
(AAAI'08). 584–589.

You, J.-H., Yuan, L.-Y., and Zhang, M. 2003. On the equivalence between answer sets and models of completion for nested logic programs. In **Proceedings of the Eighteenth**
International Joint Conference on Artificial Intelligence **(IJCAI'03)**. 859–866.