Affiliation:
1. King's College London, London, UK
2. University of Liverpool, Liverpool, UK
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference45 articles.
1. Artale A. and Franconi E. 2004. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence M. Fisher D. M. Gabbay and L. Vila Eds. Elsevier Amsterdam The Netherlands.]] Artale A. and Franconi E. 2004. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence M. Fisher D. M. Gabbay and L. Vila Eds. Elsevier Amsterdam The Netherlands.]]
2. Resolution theorem proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier, Amsterdam, The Netherlands;Bachmair L.;Chapter,2001
3. Börger E. Grädel E. and Gurevich Y. 1997. The Classical Decision Problem. Springer Berlin Germany.]] Börger E. Grädel E. and Gurevich Y. 1997. The Classical Decision Problem. Springer Berlin Germany.]]
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献