A Simplied Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic
Download:
|
|
by Anatoly Degtyarev, Michael Fisher, Boris Konev
http://www.csc.liv.ac.uk/~michael/tableaux02.ps
Add To MetaCart
Abstract:
Abstract. 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 3 main clause types and a small number of resolution rules. In this paper, we show that the normal form can be radically simpli ed and, following on from this, a simplied resolution method can be de ned for this important variety of temporal logic. 1
Citations
| 1001 | Reasoning About Knowledge – Fagin, Halpern, et al. - 1995 |
| 75 | Clausal Temporal Resolution – Fisher, Dixon, et al. - 2001 |
| 60 | A resolution method for temporal logic – Fisher - 1991 |
| 43 | Temporal description logics – Artale, Franconi - 2001 |
| 33 | Towards first-order temporal resolution – Degtyarev, Fisher - 2001 |
| 2 | Propositional temporal resolution revisited – Degtyarev, Fisher - 2000 |
| 2 | An Extension of Propositional Temporal Resolution – Degtyarev, Fisher - 2001 |
| 2 | A normal form for temporal formulae – Fisher - 1992 |
