Skip to main content

Representing Transition Systems by Logic Programs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.

    Article  Google Scholar 

  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. 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. Vladimir Lifschitz. Foundations of logic programming. In Principles of Knowledge Representation, pages 69–127. CSLI Publications, 1996.

    Google Scholar 

  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. Norman McCain. Causality in Commonsense Reasoning about Actions. PhD thesis, University of Texas at Austin, 1997.

    Google Scholar 

  11. Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460–465, 1997.

    Google Scholar 

  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. 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. Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245–298, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. Hudson Turner. Causal Action Theories and Satisfiability Planning. PhD thesis, University of Texas at Austin, 1998.

    Google Scholar 

  16. Hantao Zhang. An efficient propositional prover. In Proc. CADE-97, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lifschitz, V., Turner, H. (1999). Representing Transition Systems by Logic Programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics