Tight logic programs

Theory and Practice of Logic Programming

Volumn 3, Issue 4-5, 2003, Pages 499-518

  Erdem, Esra ^a   Lifschitz, Vladimir ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b University of Texas at Austin ^*  (United States)

Author keywords

Answer sets; Completion; Fages' theorem; Supportedness; Tightness

Indexed keywords

COMPUTER PROGRAMMING; PROBLEM SOLVING; SEMANTICS; SET THEORY; SYNTACTICS;

ANSWER SET PROGRAMMING; FAGE'S THEOREM;

LOGIC PROGRAMMING;

EID: 0344531486     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068403001765     Document Type: Article

References (18)

1. Apt, K., Blair, H. and Walker, A. 1988. Towards a theory of declarative knowledge. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann, San Mateo.
2. 16 Proc. NMR-2000.
3. Baral, C. and Gelfond, M. 1994. Logic programming and knowledge representation. Journal of Logic Programming 19, 20, 73-148.
4. Clark, K. 1978. Negation as failure. In: H. Gallaire and J. Minker (eds.), Logic and Data Bases, pp. 293-322. Plenum Press, New York.
5. Erdem, E. and Lifschitz, V. 1999. Transformations of logic programs related to causality and planning. Logic Programming and Non-monotonic Reasoning: Proc. Fifth Int'l Conf. Lecture Notes in Artificial Intelligence 1730), pp. 107-116.
6. Erdem, E. and Lifschitz, V. 2001a. Fages' theorem for programs with nested expressions. Proceedings of the Seventeenth International Conference on Logic Programming, pp. 242-254.
7. Erdem, E. and Lifschitz, V. 2001b. Transitive closure, answer sets, and predicate completion. Working Notes of the AAAI Spring Symposium on Answer Set Programming.
8. Fages, P. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
9. Ferraris, P. and Lifschitz, V. 2003. Weight constraints as nested expressions. In progress.
10. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In: R. Kowalski and K. Bowen (eds.), Logic Programming: Proc. Fifth Int'l Conf. and Symp., pp. 1070-1080.
11. Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
12. Inoue, K. and Sakama, C. 1998. Negation as failure in the head. Journal of Logic Programming 35, 39-78.
13. Lifschitz, V. 1996. Two components of an action language. Working Papers of the Third Symposium on Logical Normalizations of Commonsense Reasoning.
14. Lifschitz, V. 1999. Answer set planning. Proc. ICLP-99, pp. 23-37.
15. Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138, 39-54.
16. Lifschitz, V., Tang, L. R. and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 369-389.
17. Lloyd, J. and Topor, R. 1984. Making Prolog more expressive. Journal of Logic Programming 3, 225-240.
18. Simons, P., Niemelä, I. and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 181-234.