Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Computational Logic (TOCL)
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal resolution using a breadth-first search
Annals of Mathematics and Artificial Intelligence
Clausal resolution in a logic of rational agency
Artificial Intelligence
A New One-Pass Tableau Calculus for PLTL
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule
TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
CTL Model Checking for Processing Simple XPath Queries
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A Temporal Logic of Robustness
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
JELIA '08 Proceedings of the 11th European conference on Logics in 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
One-pass tableaux for computation tree logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
CTL-Like Fragments of a Temporal Logic of Robustness
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
An Experimental Comparison of Theorem Provers for CTL
TIME '11 Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A tableau-based decision procedure for CTL*
Formal Aspects of Computing
Hi-index | 0.00 |
The branching-time temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. We use indices in the normal form to represent particular paths and the application of the resolution rules is restricted dependent on an ordering and selection function to reduce the search space. We show that the translation preserves satisfiability, the calculus is sound, complete, and terminating, and consider the complexity of the calculus.