A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Incompleteness of first-order temporal logic with until
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
ACM Transactions on Computational Logic (TOCL)
The abc of rational agent modelling
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Axiomatising Linear Time Mu-calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Towards First-Order Temporal Resolution
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
A Normal Form for First-Order Temporal Formulae
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Vampire 1.1 (System Description)
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
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
Resolution decision procedures
Handbook of automated reasoning
Qualitative spatiotemporal representation and reasoning: a computational perspective
Exploring artificial intelligence in the new millennium
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Synthesis of communicating processes from temporal logic specifications
Synthesis of communicating processes from temporal logic specifications
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Temporal Logics of Knowledge and their Applications in Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Noetherianity and Combination Problems
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Temporal Verification of Fault-Tolerant Protocols
Methods, Models and Tools for Fault Tolerance
Quantified epistemic logics for reasoning about knowledge in multi-agent systems
Artificial Intelligence
Fair Derivations in Monodic Temporal Reasoning
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
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
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
Propositional temporal proving with reductions to a SAT problem
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Hi-index | 0.00 |
Until recently, First-Order Temporal Logic (FOTL) has been only partially understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However, a breakthrough by Hodkinson et al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of FOTL. Yet, in order to utilise these theoretical advances, it is important to have appropriate proof techniques for this monodic fragment.In this paper, we modify and extend the clausal temporal resolution technique, originally developed for propositional temporal logics, to enable its use in such monodic fragments. We develop a specific normal form for monodic formulae in FOTL, and provide a complete resolution calculus for formulae in this form. Not only is this clausal resolution technique useful as a practical proof technique for certain monodic classes, but the use of this approach provides us with increased understanding of the monodic fragment. In particular, we here show how several features of monodic FOTL can be established as corollaries of the completeness result for the clausal temporal resolution method. These include definitions of new decidable monodic classes, simplification of existing monodic classes by reductions, and completeness of clausal temporal resolution in the case of monodic logics with expanding domains, a case with much significance in both theory and practice.