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

  • Serenella Cerrito
  • Marta Cialdea Mayer
Conference paper

DOI: 10.1007/3-540-69778-0_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1397)
Cite this paper as:
Cerrito S., Mayer M.C. (1998) Bounded Model Search in Linear Temporal Logic and Its Application to Planning. In: de Swart H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1998. Lecture Notes in Computer Science, vol 1397. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Serenella Cerrito
    • 1
  • Marta Cialdea Mayer
    • 2
  1. 1.LRI, Bât 490Université de Paris-SudOrsay CedexFrance
  2. 2.Dipartimento di Informatica e AutomazioneUniversità di Roma TreRomaItalia

Personalised recommendations