Temporal resolution using a breadth-first search

Authors:
Clare Dixon
Affiliations:
Department of Computing and Mathematics, Manchester Metropolitan University, Manchester M1 5GD, UK E-mail: C.Dixon@doc.mmu.ac.uk
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
1998

Citing 26
Cited 12

Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends

Current trends in concurrency. Overviews and tutorials
Artificial intelligence

Artificial intelligence
Temporal-logic theorem proving

Temporal-logic theorem proving
The use of temporal logic in the compositional specification of concurrent systems

Temporal logics and their applications
Nonclausal deduction in first-order temporal logic

Journal of the ACM (JACM)
In transition from global to modular temporal reasoning about programs

Logics and models of concurrent systems
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Reasoning about knowledge

Reasoning about knowledge
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Proving Liveness Properties of Concurrent Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying Concurrent Processes Using Temporal Logic

Verifying Concurrent Processes Using Temporal Logic
Logic for Problem Solving

Logic for Problem Solving
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Executable Model and Temporal Logics: Proceedings of the IJCAI '93 Workshop, Chambery, France, August 28, 1993

Executable Model and Temporal Logics: Proceedings of the IJCAI '93 Workshop, Chambery, France, August 28, 1993
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
A Normal Form for First-Order Temporal Formulae

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief

FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
Search Strategies for Resolution in Temporal Logics

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Now you may compose temporal logic specifications

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A resolution method for CTL branching-time temporal logic

TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
Temporal Resolution: Removing Irrelevant Information

TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
Reasoning about digital circuits

Reasoning about digital circuits

Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Combinations of Modal Logics

Artificial Intelligence Review
Clausal resolution in a logic of rational agency

Artificial Intelligence
Algorithms for Guiding Clausal Temporal Resolution

KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
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)
Filter-based resolution principle for lattice-valued propositional logic LP(X)

Information Sciences: an International Journal
A Refined Resolution Calculus for CTL

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Mechanising first-order temporal resolution

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
CTL-RP: A computation tree logic resolution prover

AI Communications - Practical Aspects of Automated Reasoning
Implementing temporal logics: tools for execution and proof

CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
A resolution calculus for the branching-time temporal logic CTL

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to applying clausal resolution, a proof method well suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states, and temporal resolution between states. Not only has it been shown to be correct but as it consists of only one temporal resolution rule, it is particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of the temporal resolution rule is the most costly part of the method, it is on this area that we focus. Detailed algorithms for a breadth‐first search approach to the application of this rule are presented. Correctness is shown and complexity given. Analysis of the behaviour of the algorithms is carried out and we explain why this approach is an improvement to others suggested.