On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Reasoning about knowledge
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
ACM Transactions on Computational Logic (TOCL)
Towards First-Order Temporal Resolution
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Searching for Invariants Using Temporal Resolution
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
ACM Transactions on Computational Logic (TOCL)
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Implementing temporal logics: tools for execution and proof
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Labelled superposition for PLTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A PLTL-prover based on labelled superposition with partial model guidance
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Invariant-Free Clausal Temporal Resolution
Journal of Automated Reasoning
Propositional temporal proving with reductions to a SAT problem
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
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.