BDD-based automated reasoning for propositional bi-intuitionistic tense logics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on tree-tableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from the literature. In the process, we gather and analyse a set of test formulae which could form the basis of a suite of benchmark formulae for CTL.