Advertisement

Answer Set Planning

Abstract
  • Vladimir Lifschitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1730)

Abstract

In “answer set programming”[5,7] solutions to a problem are represented by answer sets (known also as stable models), and not by answer substitutions produced in response to a query, as in conventional logic programming. Instead of Prolog, answer set programming uses software systems capable of computing answer sets. Four such systems were demonstrated at the Workshop on Logic- Based AI held in June of 1999 in Washington, DC: dlv1, smodels,2, DeReS3 and ccalc4.

References

  1. 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.Google Scholar
  2. 2.
    Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359–363, 1992.Google Scholar
  3. 3.
    Vladimir Lifschitz. Action languages, answer sets and planning. In The Logic Programming Paradigm: a 25-Year Perspective, pages 357–373. Springer Verlag, 1999.Google Scholar
  4. 4.
    Vladimir Lifschitz and Hudson Turner. Representing transition systems by logic programs. This volume.Google Scholar
  5. 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.Google Scholar
  6. 6.
    Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460–465, 1997.Google Scholar
  7. 7.
    Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 1999. To appear.Google Scholar
  8. 8.
    V.S. Subrahmanian and Carlo Zaniolo. Relating stable models and AI planning domains. In Proc. ICLP-95, 1995.Google Scholar
  9. 9.
    Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming,31:245–298, 1997.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustinUSA

Personalised recommendations