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 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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hadjisoteriou, E., & Kakas, A. (2012). Argumentation and the event calculus. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7360 LNCS, 103–122. https://doi.org/10.1007/978-3-642-29414-3_7
Mendeley helps you to discover research relevant for your work.