Bounded Model Search in Linear Temporal Logic and Its Application to Planning

In this work a tableau calculus is proposed, that checks whether a finite set of formulae in propositional linear temporal logic (LTL) has a finite model whose cardinality is bounded by a constant given in input, and constructs such a model, if any. From a theoretical standpoint, the method can also be used to check finite satisfiability tout court. The following properties of the proposed calculus are proved: termination, soundness and completeness w.r.t. finite model construction. The motivation behind this work is the design of a logical language to model planning problems and an associated calculus for plan construction, integrating the declarativity, expressiveness and flexibility typical of the logical languages with the capability of embedding search-based techniques well established in the planning community.

[1]  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.

[2]  Jana Koehler,et al.  Constraint Deduction in an Interval-based Temporal Logic , 1993, Executable Modal and Temporal Logics.

[3]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic , 1990, FSTTCS.

[4]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[5]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

[6]  Qiang Yang,et al.  Formalizing planning knowledge for hierarchical planning , 1990, Comput. Intell..

[7]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[8]  Susanne Biundo-Stephan,et al.  Deduction-Based Refinement Planning , 1996, AIPS.

[9]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[10]  M. Masseron,et al.  Generating Plans in Linear Logic I. A Geometry of Conjunctive Actions , 1993, Theor. Comput. Sci..

[11]  Dov M. Gabbay,et al.  METATEM: A Framework for Programming in Temporal Logic , 1989, REX Workshop.

[12]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[13]  Reiner Hähnle,et al.  Improving Temporal Logic Tableaux Using Integer Constraints , 1994, ICTL.

[14]  Jean Goubault-Larrecq,et al.  A Tableau System for Linear-TIME Temporal Logic , 1997, TACAS.

[15]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[16]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[17]  Pierre Wolper,et al.  The tableau method for temporal logic: an overview , 1985 .

[18]  Dov M. Gabbay,et al.  Meta-Reasoning in Executable Temporal Logic , 1991, KR.

[19]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[20]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic I. Actions as Proofs , 1993, Theor. Comput. Sci..