Invariant-Free Clausal Temporal Resolution
Resolution is a well-known proof method for classical logics that is well suited for mechanization. The most fruitful approach in the literature on temporal logic, which was started with the seminal paper of M. Fisher, deals with Propositional Linear-time Temporal Logic (PLTL) and requires generatin...
| Authors: | , , , , |
|---|---|
| Format: | article |
| Publication Date: | 2011 |
| Country: | España |
| Institution: | Universidad del País Vasco |
| Repository: | Addi. Archivo Digital para la Docencia y la Investigación |
| OAI Identifier: | oai:addi.ehu.eus:10810/64604 |
| Online Access: | http://hdl.handle.net/10810/64604 |
| Access Level: | Open access |
| Keyword: | propositional linear-time temporal logic resolution invariant-free clausal normal form |
| Summary: | Resolution is a well-known proof method for classical logics that is well suited for mechanization. The most fruitful approach in the literature on temporal logic, which was started with the seminal paper of M. Fisher, deals with Propositional Linear-time Temporal Logic (PLTL) and requires generating invariants for performing resolution on eventualities. The methods and techniques developed in that approach have also been successfully adapted to obtain a clausal resolution method for Computation Tree Logic (CTL), but invariant handling seems to be a handicap for further extension to more general branching temporal logics. In this paper, we present a new approach to applying resolution to PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Hence, we say that the approach presented in this paper is invariant-free. Our method is based on the dual methods of tableaux and sequents for PLTL that we presented in a previous paper. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called trs-resolution, that extends classical propositional resolution. Finally, we prove that trs-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL |
|---|