Verification of Action Theories in ASP: A Complete Bounded Model Checking Approach

Temporal logics are well suited for reasoning about actions, as they allow for the specification of domain descriptions including temporal constraints as well as for the verification of temporal properties of the domain. This paper focuses on the verification of action theories formulated in a temporal extension of answer set programming which combines ASP with a dynamic linear time temporal logic. The paper proposes an approach to bounded model checking (BMC) which exploits the Buchi automaton construction while searching for a counterexample, with the aim of achieving completeness. The paper provides an encoding in ASP of the temporal action domains and of BMC of DLTL formulas.

[1]  Armin Biere,et al.  Bounded model checking , 2003, Adv. Comput..

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

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

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

[5]  Jorge A. Baier,et al.  A Heuristic Search Approach to Planning with Temporally Extended Preferences , 2007, IJCAI.

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

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

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

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

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

[11]  A. Gerevini,et al.  Plan Constraints and Preferences in PDDL 3 The Language of the Fifth International Planning Competition , 2005 .

[12]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2003, Theory Pract. Log. Program..

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

[14]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

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

[16]  Joël Ouaknine,et al.  Completeness and Complexity of Bounded Model Checking , 2004, VMCAI.

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

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

[19]  Stephan Merz,et al.  Model Checking , 2000 .

[20]  Sheila A. McIlraith,et al.  Optimizing Web Service Composition While Enforcing Regulations , 2009, SEMWEB.

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

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

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

[24]  Pedro Cabalar.  A Normal Form for Linear Temporal Equilibrium Logic , 2010, JELIA.

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

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

[27]  Giuseppe De Giacomo,et al.  Generalized Planning with Loops under Strong Fairness Constraints , 2010, KR.