Reasoning about actions with Temporal Answer Sets

In this paper, we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Also, we provide a translation of domain descriptions into standard ASP and use Bounded Model Checking (BMC) techniques for the verification of DLTL constraints.

[1]  Chitta Baral,et al.  Non-monotonic Temporal Logics for Goal Specification , 2007, IJCAI.

[2]  Laura Giordano,et al.  Verifying Business Process Compliance by Reasoning about Actions , 2010, CLIMA.

[3]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[4]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.

[5]  Fausto Giunchiglia,et al.  Planning as Model Checking , 1999, ECP.

[6]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[7]  Ofer Strichman,et al.  Bounded model checking , 2003, Adv. Comput..

[8]  Piergiorgio Bertoli,et al.  Automated composition of Web services via planning in asynchronous domains , 2005, Artif. Intell..

[9]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

[10]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[11]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[12]  Enrico Pontelli,et al.  Planning with preferences using logic programming , 2004, Theory and Practice of Logic Programming.

[13]  Vladimir Lifschitz,et al.  Actions with Indirect Effects (Preliminary Report) , 1994, KR.

[14]  Wolfgang Faber,et al.  Planning under Incomplete Knowledge , 2000, Computational Logic.

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

[16]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[17]  Derek Long,et al.  Plan Constraints and Preferences in PDDL3 , 2006 .

[18]  Laura Giordano,et al.  Specifying and verifying interaction protocols in a temporal action logic , 2007, J. Appl. Log..

[19]  Barbara Dunin-Keplicz,et al.  Creating Collective Intention through Dialogue , 2001, Log. J. IGPL.

[20]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

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

[22]  Gerhard Lakemeyer,et al.  A Logic for Non-Terminating Golog Programs , 2008, KR.

[23]  Tran Cao Son,et al.  Domain-dependent knowledge in answer set planning , 2002, TOCL.

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

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

[26]  Michael Gelfond,et al.  Diagnostic reasoning with A-Prolog , 2003, Theory Pract. Log. Program..

[27]  Tran Cao Son,et al.  Approximation of action theories and its application to conformant planning , 2005, Artif. Intell..

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

[29]  Laura Giordano,et al.  Tableau-based automata construction for dynamic linear time temporal logic* , 2006, Annals of Mathematics and Artificial Intelligence.

[30]  Marco Pistore,et al.  Planning with a language for extended goals , 2002, AAAI/IAAI.

[31]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[32]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[33]  Tran Cao Son,et al.  Approximation of action theories and its application to conformant planning , 2011, Artif. Intell..

[34]  P. S. Thiagarajan,et al.  Dynamic Linear Time Temporal Logic , 1997, Ann. Pure Appl. Log..

[35]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2001, Theory and Practice of Logic Programming.

[36]  Daniele Theseider Dupré,et al.  State-based vs Simulation-based Diagnosis of Dynamic Systems , 2000, ECAI.

[37]  Daniele Theseider Dupré,et al.  Causal Simulation and Diagnosis of Dynamic Systems , 2001, AI*IA.

[38]  Enrico Giunchiglia,et al.  Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism , 2000, KR.

[39]  Michel Barbeau,et al.  Planning Control Rules for Reactive Agents , 1997, Artif. Intell..

[40]  Marco Pistore,et al.  Planning as Model Checking for Extended Goals in Non-deterministic Domains , 2001, IJCAI.

[41]  Sheila A. McIlraith,et al.  Planning with Qualitative Temporal Preferences , 2006, KR.

[42]  Peter Struss,et al.  Task-dependent qualitative domain abstraction , 2005, Artif. Intell..

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

[44]  Daniele Theseider Dupré,et al.  An Inductive Definition Approach to Ramifications , 1998, Electron. Trans. Artif. Intell..