Loop formulas for disjunctive logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2916, Issue , 2003, Pages 451-465

  Lee, Joohyung ^a   Lifschitz, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; DISJUNCTIVE LOGIC PROGRAMS; LOOP FORMULAS;

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE;

LOGIC PROGRAMMING;

EID: 0346264951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24599-5_31     Document Type: Conference Paper

References (15)

1. Yuliya Babovich, Esra Erdem, and Vladimir Lifschitz. Fages' theorem and answer set programming.12 In Proc. Eighth Int'l Workshop on Non-Monotonic Reasoning, 2000.
2. Chitta Baral and Michael Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19,20:73-148, 1994.
3. Rachel Ben-Eliyahu and Rina Dechter. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12:53-87, 1996.
4. Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
5. Thomas Eiter and Georg Gottlob. Complexity results for disjunctive logic programming and application to nonmonotonic logics. In Dale Miller, editor, Proc. ILPS-93, pages 266-278, 1993.
6. Esra Erdem and Vladimir Lifschitz. Transformations of logic programs related to causality and planning. In Logic Programming and Nonmonotonic Reasoning: Proc. Fifth Int'l Conf. (Lecture Notes in Artificial Intelligence 1730), pages 107-116, 1999.
7. Esra Erdem and Vladimir Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3:499-518, 2003.
8. François Fages. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
9. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Logic Programming: Proc. Fifth Int'l Conf. and Symp., pages 1070-1080, 1988.
10. Katsumi Inoue and Chiaki Sakama. Negation as failure in the head. Journal of Logic Programming, 35:39-78, 1998.
11. Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999.
12. Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
13. Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-02, 2002.
14. John Lloyd and Rodney Topor. Making Prolog more expressive. Journal of Logic Programming, 3:225-240, 1984.
15. Victor Marek and V.S. Subrahmanian. The relationship between logic program semantics and non-monotonic reasoning. In Giorgio Levi and Maurizio Martelli, editors, Logic Programming: Proc. Sixth Int'l Conf., pages 600-617, 1989.