Abstract

The search for finite models of temporal logic specifications furnishes a logical, though non-deductive, approch to planning, that opens the way to the exploitation of methodologies and techniques from classical search-based approaches, such as plan-space search, regression and least commitment. In this paper a tableau based decision procedure for finite satisfiability of linear temporal formulae is presented. The method is based on prefixed tableaux, where a partial order on prefixes is built in each branch step by step. A form of soundness and completeness w.r.t. finite model construction are established. Finally, some constraints on tableau construction are established, ensuring that the tableau procedure always terminates and returns a finite model of the initial set of formulae, if there exists one.

Citations