Skip to main content

An Argumentation Framework for Reasoning about Actions and Change

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1730))

Abstract

We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and change, can be translated into the argumentation framework of Logic Programming without Negation as Failure (LPwNF). This translation enables us 1) to understand default persistence as captured by various temporal reasoning frameworks in a simple and natural way, by assigning higher priority to information about effects of later actions over effects of earlier actions; 2) to develop an argumentation-based computational model for this type of reasoning in logic programming goal-driven style.

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. A. Bondarenko, P. M. Dung, R. A. Kowalski, F. Toni. An abstract, argumentation-theoretic framework for default reasoning. AI 93(1-2) 63–101 (1997).

    MATH  MathSciNet  Google Scholar 

  2. S.-E. Bornscheuer and M. Thielscher. Explicit and Implicit Indeterminism: Reasoning about uncertain and contradictory specifications of dynamic systems. JLP 31(1-3) 119–155, 1997.

    MATH  MathSciNet  Google Scholar 

  3. M. Denecker and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. ILPS’93, MIT Press.

    Google Scholar 

  4. Y. Dimopoulos and A.C. Kakas. Logic Programming without Negation as Failure. ILPS’95, 369–383, MIT Press.

    Google Scholar 

  5. P. M. Dung. Representing Actions in Logic Programming and its Applications in Database Updates. ICLP’93, 222–238, MIT Press.

    Google Scholar 

  6. P. M. Dung. The acceptability of arguments and its fundamental role in non-monotonic reasoning and logic programming and n-person game. AI 77 321–357, 1995.

    Google Scholar 

  7. M. Gelfond and V. Lifschitz. Representing Actions in Extended Logic Programming. JICSLP’92, 560, MIT Press.

    Google Scholar 

  8. M. Gelfond and V. Lifschitz. Representing Action and Change by Logic Programs. JLP, 17 (2,3,4) 301–322, 1993.

    Google Scholar 

  9. A.C. Kakas and R.S. Miller. Reasoning about Actions, Narratives and Ramifications. Journal of Electronic Transactions on Artificial Intelligence 1(4), 1997.

    Google Scholar 

  10. A.C. Kakas and R.S. Miller. A Simple Declarative Language for Describing Narratives with Actions. JLP 31(1-3) (Special Issue on Reasoning about Action and Change) 157–200, 1997.

    Google Scholar 

  11. A. C. Kakas and F. Toni. Computing argumentation in logic programming. To appear in JLC, Oxford University Press, 1999.

    Google Scholar 

  12. R.A. Kowalski and M. Sergot. A Logic-Based Calculus of Events. New Generation Computing 4, 267, 1986.

    Article  Google Scholar 

  13. M. Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Commonsense Law of Inertia, MIT Press, 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

Kakas, A., Miller, R., Toni, F. (1999). An Argumentation Framework for Reasoning about Actions and Change. 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_6

Download citation

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

  • 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