In this paper, we introduce a new fragment of the ΓΏrst-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 satisΓΏability problem for monodic formulas in various linear time st
Investigations on Fragments of First Order Branching Temporal Logic
β Scribed by Franco Montagna; G. Michele Pinna; B. P. Tiezzi
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 195 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is known that even seemingly small fragments of the ΓΏrst-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic (not monadic, where this result does not hold) fragment is an exception by constructing its ΓΏnite Hilbert-style axiomatizat
We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomial-time model checking is possible even
The consistency of a rule base is an essential issue for rule-based intelligent information processing. Due to the uncertainty inevitably included in the rule base, it is necessary to verify the consistency of the rule base while investigating, designing, and applying a rule-based intelligent system