Advertisement

Representing Transition Systems by Logic Programs

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

Abstract

This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C.We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. The translations from C into logic programming that we investigate serve as a basis for the use of systems for computing answer sets to reason about action domains described in C and to generate plans in such domains.

Keywords

Logic Program Logic Programming Causal Theory Split Mapping Propositional Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.Google Scholar
  2. 2.
    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
  3. 3.
    Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, and Francesco Scarcello. The KR system dlv: Progress report, comparisons and benchmarks. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proc. Sixth Int’l Conf. on Principles of Knowledge Representation and Reasoning, pages 406–417, 1998.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.CrossRefGoogle Scholar
  6. 6.
    Michael Gelfond and Vladimir Lifschitz. Action languages. Electronic Transactions on AI, 3, 1998. Available at http://www.ep.liu.se/ea/cis/1998/016/.
  7. 7.
    Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623–630, 1998.Google Scholar
  8. 8.
    Vladimir Lifschitz. Foundations of logic programming. In Principles of Knowledge Representation, pages 69–127. CSLI Publications, 1996.Google Scholar
  9. 9.
    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
  10. 10.
    Norman McCain. Causality in Commonsense Reasoning about Actions. PhD thesis, University of Texas at Austin, 1997.Google Scholar
  11. 11.
    Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460–465, 1997.Google Scholar
  12. 12.
    Norman McCain and Hudson Turner. Satisfiability planning with causal theories. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proc. Sixth Int’l Conf. on Principles of Knowledge Representation and Reasoning, pages 212–223, 1998.Google Scholar
  13. 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.Google Scholar
  14. 14.
    Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245–298, 1997.MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hudson Turner. Causal Action Theories and Satisfiability Planning. PhD thesis, University of Texas at Austin, 1998.Google Scholar
  16. 16.
    Hantao Zhang. An efficient propositional prover. In Proc. CADE-97, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  • Hudson Turner
    • 2
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustinUSA
  2. 2.Department of Computer ScienceUniversity of Minnesota at DuluthDuluthUSA

Personalised recommendations