Answer set planning

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

Volumn 1730, Issue , 1999, Pages 373-374

  Lifschitz, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 37549047485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_28     Document Type: Conference Paper

References (9)

1. Yannis Dimopoulos, Bernhard Nebel, and Jana Koehler. Encoding planning problems in non-monotonic logic programs. In Proc. European Conf. on Planning 1997, pages 169-181, 1997.
2. Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359-363, 1992.
3. Vladimir Lifschitz. Action languages, answer sets and planning. In The Logic Programming Paradigm: a 25-Year Perspective, pages 357-373. Springer Verlag, 1999.
4. Vladimir Lifschitz and Hudson Turner. Representing transition systems by logic programs. This volume.
5. Victor Marek and Miros law Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer Verlag, 1999.
6. Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460-465, 1997.
7. Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 1999. To appear.
8. V.S. Subrahmanian and Carlo Zaniolo. Relating stable models and AI planning domains. In Proc. ICLP-95, 1995.
9. Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245-298, 1997.