Abstract
The language ε for reasoning about actions and change can be translated into an argumentation framework. In this paper, we extend this translation of the basic language and showh ow it can, together with methods from abduction, form the basis for a principled implementation of ε. The extension we have considered concerns the addition of new type of sentences in the language as well as allowing theories where the narrative of events given is incomplete.
A system, called ε-RES, is developed within the argumentation framework of Logic Programming without Negation as Failure (LPωNF). This can support directly a variety of modes of common sense reasoning such as: default persistence in credulous or sceptical form, assimilation of observations and their diagnosis possibly under incomplete information, as well as combinations of these. To improve the efficiency of the system we have considered the integration of a SAT solver within the εLPωNF computation, to carry out the of validating the time universal constraints imposed by ramification statements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Baral, S. McIlraith, and T. Son. Formulating diagnostic problem solving using an action language with narratives and sensing. In KR-00, 2000. 265
A. Bondarenko, P. M. Dung, R. A. Kowalski, and F. Toni. An abstract, argumentation-theoretic framework for default reasoning. Journal of Artificial Inelligence, 93(1-2):63–101, 1997. 254
D. Dimopoulos and A. C. Kakas. Logic programming without negation as failure. In Proc. of ILPS’95, volume pp. 369–383, 1995. 254
M. Gelfond and J. Galloway. Diagnosing dynamic systems in a-prolog. In Answer Set Programming, AAAI Symposium (to appear), 2001. 265
M. Gelfond and V. Lifschitz. Action languages. In ETAI, volume 3(16), 1998. 265
I. Gent, H. van Maaren, and T. Walsh. Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000. 255, 265
E. Giuchiglia. Planning as satisfiability with expressive action languages. In KR-00, 2000. 266
E. Giuchiglia and V. Lifschitz. An action language based on casual explanation. In AAAI-98, pages 623–630, 1998. 265
A. C. Kakas, R. A. Kowalski, and F. Toni. The role of abduction in logic programming. In Handbook of Logic in AI and Logic Programming, volume 5, pages 235–324. OU Press, 1998. 254, 257
A. C. Kakas and R. S. Miller. A simple declarative language for describing narratives with actions. In JLP 31(1-3), pp. 157–200, 1997. 254
A. C. Kakas, R. S. Miller, and F. Toni. An argumentation framework for reasoning about actions and change. In LPNMR’99, 78–91, Springer Verlag, 1999. 257
H. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. Scherl. Golog: A logic programming language for dynamic domains. Logic Programming, 31:59–84, 1997. 265
N. McCain. Causality in Commonsense Reasoning about Actions. PhD thesis, University of Texas at Austin, 1997. 266
M. Shanahan. An abductive event calculus planner. Logic Programming, 44(1-3):207–239, 2000. 265
M. Thielscher. Representing the knowledge of a robot. In Proc.KR00, pages 109–120, 2000. 265
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakas, A., Miller, R., Toni, F. (2001). ε-RES: Reasoning about Actions, Events and Observations. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42593-9
Online ISBN: 978-3-540-45402-1
eBook Packages: Springer Book Archive