Fages’ theorem for programs with nested expressions

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

Volumn 2237, Issue , 2001, Pages 242-254

  Erdem, Esra ^a   Lifschitz, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; SEMANTICS;

ANSWER SET; ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; LOGIC PROGRAMS; NESTED EXPRESSIONS; SMODELS;

LOGIC PROGRAMMING;

EID: 84937212088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_24     Document Type: Conference Paper

References (16)

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. Yuliya Babovich, Esra Erdem, and Vladimir Lifschitz. Fages’ theorem and answer set programming.9 In Proc. NMR-2000, 2000.
3. Roberto Bayardo and Robert Schrag. Using CSP look-back techniques to solve realworld SAT instances. In Proc. IJCAI-97, pages 203–208, 1997.
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. Marc Denecker and Bert Van Nuffelen. Experiments for integration CLP and abduction. 10 In Krysztof R. Apt, Antonios C. Kakas, Eric Monfroy, and Francesca Rossi, editors, Proceedings of the 1999 ERCIM/COMPULOG workshop on Constraints, pages 1–15, 1999.
6. Thomas Eiter, Nicola Leone, Christinel Mateis, Gerald Pfeifer, and Francesco Scarcello. A deductive system for non-monotonic reasoning. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 363–374. Springer-Verlag, 1997.
7. Francois Fages. Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51–60, 1994.
8. Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions.11 Unpublished draft, 2001.
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. Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369–389, 1999.
11. Vladimir Lifschitz. Answer set planning. In Proc. ICLP-99, pages 23–37, 1999.
12. John Lloyd and Rodney Topor. Making Prolog more expressive. Journal of Logic Programming, 3:225–240, 1984.
13. Ilkka Niemelä and Patrik Simons. Efficient implementation of the well-founded and stable model semantics. In Proc. Joint Int’l Conf. and Symp. on Logic Programming, pages 289–303, 1996.
14. Nikolay Pelov, Emmanuel De Mot, and Marc Denecker. Logic programming approaches for representing and solving constraint satisfaction problems: a comparison. 12 In Parigot M. and Voronkov A., editors, Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning, volume 1955 of Lecture Notes in Artificial Intelligence, pages 225–239. Springer, 2000.
15. Pascal van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
16. Hantao Zhang. SATO: An efficient propositional prover. In Proc. CADE-97, 1997.