Characterising Finite Domains in Monodic First-Order Temporal Logic
نویسندگان
چکیده
In this paper we introduce a syntactic characterisation of finite domains in first-order temporal logics. In addition to showing that this characterisation is complete with respect to finite domains, we show that the formulae are still within a decidable fragment of first-order temporal logic. This allows us to automatically verify certain finite properties of temporal specifications simply by adding the characteristic formula to the specification and carrying out verification as usual.
منابع مشابه
Exploring the Monodic Fragment of First-Order Temporal Logic using Clausal Temporal Resolution
Until recently, first-order temporal logic has been little 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 available. However, a breakthrough by Hodkinson et.al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of first-order temporal logi...
متن کاملDecidable fragment of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملDecidable fragments of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملHandling Equality in Monodic Temporal Resolution
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise the monodic reso...
متن کاملTowards First-Order Temporal Resolution
In this paper we show how to extend clausal temporal resolution to the ground eventuality fragment of monodic first-order temporal logic, which has recently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolutionbased proof system ...
متن کامل