ASP for Reasoning about Actions with an EL^bot Knowledge Base

In this paper we propose an approach based on Answer Set Programming (ASP) for reasoning about actions in a domain description including knowledge expressed in the low complexity description logic EL⊥. We consider an action theory in which the state is a set of positive and negative assertions, that we represent through explicit negation. The action language allows for non-deterministic actions, and causal rules are introduced to deal with ramifications. We provide sufficient conditions under which action consistency can be guaranteed and we define a polynomial encoding of the action theory in ASP.

[1]  Vladimir Lifschitz,et al.  Frames in the Space of Situations , 1990, Artif. Intell..

[2]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[3]  Laura Giordano,et al.  Ramification and causality in a modal action logic , 2000, J. Log. Comput..

[4]  Franz Baader,et al.  Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics , 2010, LPAR.

[5]  Franz Baader,et al.  Integrating Description Logics and Action Formalisms: First Results , 2005, Description Logics.

[6]  Wolfgang Faber,et al.  A logic programming approach to knowledge-state planning: Semantics and complexity , 2004, TOCL.

[7]  Diego Calvanese,et al.  Verification of Inconsistency-Aware Knowledge and Action Bases , 2013, Description Logics.

[8]  Chitta Baral,et al.  Reasoning agents in dynamic domains , 2000 .

[9]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[10]  Laura Giordano,et al.  Reasoning about actions with Temporal Answer Sets , 2011, Theory and Practice of Logic Programming.

[11]  Liang Chang,et al.  A Family of Dynamic Description Logics for Representing and Reasoning About Actions , 2012, Journal of Automated Reasoning.

[12]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[13]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[14]  Diego Calvanese,et al.  Managing Change in Graph-Structured Data Using Description Logics , 2014, Description Logics.

[15]  Franz Baader,et al.  Verifying Properties of Infinite Sequences of Description Logic Actions , 2010, ECAI.

[16]  Hudson Turner,et al.  A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.

[17]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[18]  Markus Krötzsch.  Efficient Inferencing for OWL EL , 2010, JELIA.

[19]  Thomas Eiter,et al.  Uniform Evaluation of Nonmonotonic DL-Programs , 2012, FoIKS.

[20]  Diego Calvanese,et al.  Description Logic Knowledge and Action Bases , 2014, J. Artif. Intell. Res..

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

[22]  Carsten Lutz,et al.  Reasoning About Actions Using Description Logics with General TBoxes , 2006, JELIA.

[23]  Laura Giordano,et al.  Reasoning about Actions in Dynamic Linear Time Temporal Logic , 2001, Log. J. IGPL.

[24]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[25]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.