Frame consistency: computing with causal explanations

This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abductive reasoning based on the notions of ”deserts” and ”oases” on the time line. Our work is motivated from the need to recover from the inconsistency that can arise when observations of fluents are added to the narrative of a domain description. We study how such observations can be assimilated via abductive explanations in order to render the domain frame consistent. Typically, such explanations would involve non-ground events whose time of occurrence can only be constraint within some interval. We present some notions of minimal commitment for such explanations and study how we can reason and compute with these explanations once they have been chosen and added to the theory. The computational model proposed can be readily implemented by exploiting, in a modular way, any of the different computational models for Abductive Logic Programming or for Answer Set Programming, augmented, again in a modular way, by suitable forms of temporal constraint solving.

[1]  Andrew B. Baker,et al.  A Simple Solution to the Yale Shooting Problem , 1989, KR.

[2]  Antonis C. Kakas,et al.  Reasoning about Actions, Narratives and Ramification , 1997, Electron. Trans. Artif. Intell..

[3]  Paolo Mancarella,et al.  A logic-based approach to model computees , 2003 .

[4]  Raymond Reiter,et al.  Reasoning about time in the situation calculus , 1995, Annals of Mathematics and Artificial Intelligence.

[5]  ABDUL SATTAR,et al.  Using crucial literals to select better theories , 1991, Comput. Intell..

[6]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

[7]  Murray Shanahan,et al.  Prediction is Deduction but Explanation is Abduction , 1989, IJCAI.

[8]  Antonis C. Kakas,et al.  A Simple Declarative Language for Describing Narratives With Actions , 1997, J. Log. Program..

[9]  Antonis C. Kakas,et al.  E-RES: Reasoning about Actions, Events and Observations , 2001, LPNMR.

[10]  Ken Satoh,et al.  A Query Evaluation Method for Abductive Logic Programming , 1992, Joint International Conference and Symposium on Logic Programming.

[11]  Maurice Bruynooghe,et al.  Temporal Reasoning with Abductive Event Calculus , 1992, ECAI.

[12]  Antonis C. Kakas,et al.  ACLP: Abductive Constraint Logic Programming , 2000, J. Log. Program..

[13]  Maurice Bruynooghe,et al.  CHICA, an Abductive Planning System Based on Event Calculus , 1995, J. Log. Comput..

[14]  Henry A. Kautz The Logic of Persistence , 1986, AAAI.

[15]  Murray Shanahan,et al.  An abductive event calculus planner , 2000, J. Log. Program..

[16]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[17]  P. Vanbeek Reasoning about qualitative temporal information , 1992 .

[18]  Michael Thielscher,et al.  The Qualification Problem: A solution to the problem of anomalous models , 2001, Artif. Intell..

[19]  Raymond Reiter,et al.  Open World Planning in the Situation Calculus , 2000, AAAI/IAAI.

[20]  Kave Eshghi,et al.  Abductive Planning with Event Calculus , 1988, ICLP/SLP.

[21]  Murray Shanahan Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[22]  Chitta Baral,et al.  Representing Actions: Laws, Observations and Hypotheses , 1997, J. Log. Program..