A model-theoretic counterpart of loop formulas

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 503-508

  Lee, Joohyung ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; CLARK'S COMPLETION; INFINITE PROGRAMS; LOGIC PROGRAMS; LOOP FORMULAS; MODEL-THEORETIC;

LOGIC PROGRAMMING;

ARTIFICIAL INTELLIGENCE;

EID: 84880760304     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Krzysztof Apt, Howard Blair, and Adrian Walker. Towards a theory of declarative knowledge. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann, San Mateo, CA, 1988.
2. Chitta Baral and Michael Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19,20:73-148, 1994.
3. Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
4. Esra Erdem and Vladimir Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3:499-518, 2003.
5. Selim Erdoǧan and Vladimir Lifschitz. Definitions in answer set programming. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 114-126, 2004.
6. François Fages. Consistency of Clark's completion and existence of stablemodels. Journal ofMethods of Logic in Computer Science, 1:51-60, 1994.
7. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of International Logic Programming Conference and Symposium, pages 1070-1080, 1988.
8. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
9. Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea. SAT-based answer set programming. In Proc. AAAI-04, pages 61-66, 2004.
10. Katsumi Inoue and Chiaki Sakama. Negation as failure in the head. Journal of Logic Programming, 35:39-78, 1998.
11. Joohyung Lee and Vladimir Lifschitz. Loop formulas for disjunctive logic programs. In Proc. ICLP- 03, pages 451-465, 2003.
12. Nicola Leone, Pasquale Rullo, and Francesco Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2):69-112, 1997.
13. Vladimir Lifschitz and Alexander Razborov. Why are there so many loop formulas? ACM Transactions on Computational Logic, 2004. To appear.
14. Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999.
15. Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157:115-137, 2004.
16. Teodor Przymusinski. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning, 5:167-205, 1989.
17. Domenico Saccá and Carlo Zaniolo. Stable models and non-determinism in logic programs with negation. In Proceedings of Symposium on Principles of Database Systems (PODS), pages 205-217, 1990.
18. Allen Van Gelder, Kenneth Ross, and John Schlipf. The well-founded semantics for general logic programs. Journal of ACM, 38(3):620-650, 1991.