The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
Automated reasoning (2nd ed.): introduction and applications
Automated reasoning (2nd ed.): introduction and applications
Handbook of theoretical computer science (vol. B)
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
Handbook of logic in computer science (vol. 2)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
The imperative future: principles of executable temporal logic
The imperative future: principles of executable temporal logic
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
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
Journal of Automated Reasoning
A Decision Method for Temporal Logic Based on Resolution
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
A New One-Pass Tableau Calculus for PLTL
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Proceedings of the Conference on Logic of Programs
Proceedings of the Conference on Logic of Programs
A Decision Method for Linear Temporal Logic
Proceedings of the 7th International Conference on Automated Deduction
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A Normal Form for First-Order Temporal Formulae
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
Search Strategies for Resolution in Temporal Logics
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A resolution method for CTL branching-time temporal logic
TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
The Set of Support Strategy in Temporal Resolution
TIME '98 Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning
Introducing Temporal Description Logics
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
Artificial Intelligence Review
Clausal resolution in a logic of rational agency
Artificial Intelligence
Searching for Invariants Using Temporal Resolution
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verification within the KARO Agent Theory
FAABS '00 Proceedings of the First International Workshop on Formal Approaches to Agent-Based Systems-Revised Papers
A Comparison of Two Proof Critics: Power vs. Robustness
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Towards First-Order Temporal Resolution
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Algorithms for Guiding Clausal Temporal Resolution
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On feasible cases of checking multi-agent systems behavior
Theoretical Computer Science - Logic and complexity in computer science
Temporal Development Methods for Agent-Based
Autonomous Agents and Multi-Agent Systems
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
ACM Transactions on Computational Logic (TOCL)
A clausal resolution method for branching-time logic ECTL+
Annals of Mathematics and Artificial Intelligence
Temporal Logics of Knowledge and their Applications in Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Clausal resolution for normal modal logics
Journal of Algorithms
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Temporal similarity by measuring possibilistic uncertainty in CBR
Fuzzy Sets and Systems
Verification from Declarative Specifications Using Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Refined Resolution Calculus for CTL
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Fair Derivations in Monodic Temporal Reasoning
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Implementing a fair monodic temporal logic prover
AI Communications - Practical Aspects of Automated Reasoning
CTL-RP: A computation tree logic resolution prover
AI Communications - Practical Aspects of Automated Reasoning
Boolean abstraction for temporal logic satisfiability
CAV'07 Proceedings of the 19th international conference on Computer aided verification
One-pass tableaux for computation tree logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Natural deduction calculus for linear-time temporal logic
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Anti-prenexing and prenexing for modal logics
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Logical implementation of uncertain agents
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Towards a notion of unsatisfiable cores for LTL
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Temporal logics over transitive states
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Deciding monodic fragments by temporal resolution
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Implementing temporal logics: tools for execution and proof
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
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
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Propositional temporal proving with reductions to a SAT problem
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
Verification and enforcement of access control policies
Formal Methods in System Design
| Hi-index | 0.00 |
In this article, we examine how clausal resolution can be applied to a specific, but widely used, nonclassical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples, and examine the correctness and complexity of this approach. Finally, we describe related work and future developments concerning this work.