Elementary sets for logic programs

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 244-249

  Gebser, Martin ^a   Lee, Joohyung ^b   Lierler, Yuliya ^c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b Arizona State University   (United States)

^c University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SOFTWARE; GRAPH THEORY; SET THEORY; THEOREM PROVING;

CLARK'S COMPLETION; LOOP FORMULA; NONDISJUNCTIVE LOGIC PROGRAM;

LOGIC PROGRAMMING;

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

References (10)

1. Anger, C.; Gebser, M.; and Schaub, T. 2006. Approaching the core of unfounded sets. In Proc. NMR 2006.
2. Ben-Eliyahu, R., and Dechter, R. 1994. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12(1-2):53-87.
3. Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. New York: Plenum Press. 293-322.
4. Gebser, M., and Schaub, T. 2005. Loops: Relevant or redundant? In Proc. LPNMR 2005, 53-65.
5. Giunchiglia, E.; Lierler, Y.; and Maratea, M. 2004. SAT-based answer set programming. In Proc. AAAI 2004, 61-66.
6. Lee, J. 2005. A model-theoretic counterpart of loop formulas. In Proc. IJCAI 2005, 503-508.
7. Leone, N.; Rullo, P.; and Scarcello, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2):69-112.
8. Lin, F., and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157:115-137.
9. Saccá, D., and Zaniolo, C. 1990. Stable models and non-determinism in logic programs with negation. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), 205-217.
10. Van Gelder, A.; Ross, K.; and Schlipf, J. 1991. The well-founded semantics for general logic programs. Journal of ACM 38(3):620-650.