The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Journal of Symbolic Computation
Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
On the feasibility of checking temporal integrity constraints
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
ACM Transactions on Computational Logic (TOCL)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal resolution using a breadth-first search
Annals of Mathematics and Artificial Intelligence
A Decision Method for Temporal Logic Based on Resolution
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
A Decision Method for Linear Temporal Logic
Proceedings of the 7th International Conference on Automated Deduction
The Set of Support Strategy in Temporal Resolution
TIME '98 Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Temporal similarity by measuring possibilistic uncertainty in CBR
Fuzzy Sets and Systems
Fair Derivations in Monodic Temporal Reasoning
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Implementing a fair monodic temporal logic prover
AI Communications - Practical Aspects of Automated Reasoning
Labelled superposition for PLTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
Clausal temporal resolution is characterised by a translation of the formulae whose satisfiability is to be established to a normal form, step resolution (similar to classical resolution) on formulae occurring at the same states and temporal resolution between formulae describing properties over a longer period. The most complex part of the method occurs in searching for candidates for the temporal resolution operation, something that may need to be carried out several times.In this paper we consider a new technique for finding the candidates for the temporal resolution operation. Although related to the previously developed external search procedure, this new approach not only allows the temporal resolution operation to be carried out at any moment, but also simplifies any subsequent search required for similar temporal formulae.Finally, in contrast with previous approaches, this search can be seen as an inherent part of the resolution process, rather than an external procedure that is only called in certain situations.