Skip to main content

Argumentation and the Event Calculus

  • Chapter

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

Abstract

We study how the problem of temporal projection can be formalized in terms of argumentation. In particular, we extend earlier work of translating the language \(\mathcal{E}\) for Reasoning about Actions and Change into a Logic Programming argumentation framework, by introducing new types of arguments for (i) backward persistence and (ii) persistence from observations. The paper discusses how this extended argumentation formulation is close to the original Event Calculus proposed by Kowalski and Sergot in 1986.

Keywords

  • Argumentation
  • Event Calculus
  • Reasoning about Actions

An earlier version of this paper appeared in [2].

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–357 (1995)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Hadjisoteriou, E., Kakas, A.C.: Argumentation and temporal persistence. In: Proceedings of the 7th Panhellenic Logic Symposium, Patras, July 15-19 (2009)

    Google Scholar 

  3. Kakas, A.C., Mancarella, P., Dung, P.M.: The acceptability semantics for logic programs. In: ICLP, pp. 504–519 (1994)

    Google Scholar 

  4. Kakas, A.C., Miller, R.: A simple declarative language for describing narratives with actions. J. Log. Program. 31(1-3), 157–200 (1997)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Kakas, A.C., Miller, R., Toni, F.: An Argumentation Framework for Reasoning about Actions and Change. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 78–91. Springer, Heidelberg (1999)

    CrossRef  Google Scholar 

  6. Kowalski, R., Sergot, M.: A logic-based calculus of events. New Gen. Comput. 4(1), 67–95 (1986)

    CrossRef  Google Scholar 

  7. Miller, R., Shanahan, M.: The event calculus in classical logic - alternative axiomatisations. Electron. Trans. Artif. Intell. 3(A), 77–105 (1999)

    MathSciNet  Google Scholar 

  8. Shanahan, M.: Solving the frame problem - a mathematical investigation of the common sense law of inertia. MIT Press (1997)

    Google Scholar 

  9. Thielscher, M.: The Qualification Problem: A Solution to the Problem of Anomalous Models. AIJ 131(1-2), 1–37 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hadjisoteriou, E., Kakas, A. (2012). Argumentation and the Event Calculus. In: Artikis, A., Craven, R., Kesim Çiçekli, N., Sadighi, B., Stathis, K. (eds) Logic Programs, Norms and Action. Lecture Notes in Computer Science(), vol 7360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29414-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29414-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29413-6

  • Online ISBN: 978-3-642-29414-3

  • eBook Packages: Computer ScienceComputer Science (R0)