Clausal resolution in a logic of rational agency
Artificial Intelligence
A clausal resolution method for branching-time logic ECTL+
Annals of Mathematics and Artificial Intelligence
A Refined Resolution Calculus for CTL
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
CTL-RP: A computation tree logic resolution prover
AI Communications - Practical Aspects of Automated Reasoning
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In this paper, we propose algorithms to implement a branching time temporal resolution theorem prover. The branching time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. Unlike the majority of the research into temporal logic, we adopt a resolution-based approach. The method applies step and temporal resolution rules to the set of formulae in a normal form. Whilst step resolution is similar to the classical resolution rule, the temporal resolution rule resolves a formula, F, which must eventually occur with a set of formulae that together imply that F can never occur. Thus, the method is dependent on the efficient detection of such sets of formulae. We present algorithms to search for these sets of formulae, give a correctness argument, and examples of their operation.