Bartholomew, M. and Lee, J. 2012. Stable models of formulas with intensional functions. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR).
Erdem, E. and Lifschitz, V. 2003. Tight logic programs. Theory and Practice of Logic Programming 3, 499–518.
Fages, F. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60.
Ferraris, P., Lee, J. and Lifschitz, V. 2011. Stable models and circumscription. Artificial Intelligence 175, 236–263.
Lee, J. and Meng, Y. 2011. First-order stable model semantics and first-order loop formulas. Journal of Artificial Inteligence Research (JAIR) 42, 125–180.
Lifschitz, V. 1996. Foundations of logic programming. In Principles of Knowledge Representation, Brewka, G., Ed. CSLI Publications, 69–128.
Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541.
Lifschitz, V., Pearce, D. and Valverde, A. 2007. A characterization of strong equivalence for logic programs with variables. In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 188–200.
Lin, F. and Zhao, J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 853–864.
Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157, 115–137.
Lloyd, J. and Topor, R. 1984. Making Prolog more expressive. Journal of Logic Programming 1, 225–240.