A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic

The clausal resolution method for propositional linear-time temporal logics is well known and provides the basis for a number of temporal provers. The method is based on an intuitive clausal form, called SNF, comprising three main clause types and a small number of resolution rules. In this paper, we show how the normal form can be radically simplified and, consequently, how a simplified clausal resolution method can be defined for this important variety of logic.

[1]  Ullrich Hustadt,et al.  Scientific Benchmarking with Temporal Logic Decision Procedures , 2002, KR.

[2]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[3]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[4]  Michael Fisher,et al.  Towards First-Order Temporal Resolution , 2001, KI/ÖGAI.

[5]  Temporalizing Description Logics , 1998, FroCoS.

[6]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

[7]  Michael Fisher,et al.  Propositional Temporal Resolution Revised , 2000, ARW.

[8]  M. Shanahan.  Solving the frame problem , 1997 .

[9]  Anand S. Rao,et al.  Decision Procedures for BDI Logics , 1998, J. Log. Comput..

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

[11]  Michael Fisher,et al.  An introduction to executable temporal logics , 1996, The Knowledge Engineering Review.

[12]  Clare Dixon,et al.  Clausal temporal resolution , 1999, TOCL.

[13]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[14]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[15]  Michael Fisher,et al.  A Resolution Method for Temporal Logic , 1991, IJCAI.

[16]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.