Implementing a fair monodic temporal logic prover

Authors:
Michel Ludwig;Ullrich Hustadt
Affiliations:
-;Department of Computer Science, University of Liverpool, Liverpool, UK. E-mails: {Michel.Ludwig, U.Hustadt}@liverpool.ac.uk
Venue:
AI Communications - Practical Aspects of Automated Reasoning
Year:
2010

Citing 15
Cited 2

Automating the Knuth Bendix ordering

Acta Informatica
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Term rewriting and all that

Term rewriting and all that
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Handbook of Automated Reasoning: Volume 1

Handbook of Automated Reasoning: Volume 1
Algorithms for Guiding Clausal Temporal Resolution

KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Term indexing

Handbook of automated reasoning
Combining superposition, sorts and splitting

Handbook of automated reasoning
Monodic temporal resolution

ACM Transactions on Computational Logic (TOCL)
First-Order Temporal Verification in Practice

Journal of Automated Reasoning
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
Practical First-Order Temporal Reasoning

TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
Mechanising first-order temporal resolution

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Deciding monodic fragments by temporal resolution

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Fair Derivations in Monodic Temporal Reasoning

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Evaluating LTL satisfiability solvers

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Monodic first-order temporal logic is a fragment of first-order temporal logic for which sound and complete calculi have been devised. One such calculus is ordered fine-grained resolution with selection, which is implemented in the theorem prover TeMP. However, the architecture of TeMP cannot guarantee the fairness of its derivations. In this paper we present an architecture for a resolution-based monodic first-order temporal logic prover that can ensure fair derivations and we describe the implementation of this fair architecture in the theorem prover TSPASS.