Introduction to algorithms
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Constraint Deduction in an Interval-based Temporal Logic
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
A Tableau System for Linear-TIME Temporal Logic
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
METATEM: A Framework for Programming in Temporal Logic
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Planning for temporally extended goals
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
First Order Linear Temporal Logic over Finite Time Structures
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
The planning spectrum: one, two, three, infinity
Journal of Artificial Intelligence Research
Active learning of plans for safety and reachability goals with partial observability
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
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.