|
Ian Hodkinson: monodic fragments of first-order temporal logic (908 words) |
 | This paper proves decidability of satisfiability of sentences of the monodic packed fragment of first-order temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. |
| The aim of this paper is to summarize and analyze some results obtained in 2000--2001 about decidable and undecidable fragments of various first-order temporal logics, give some applications in the field of knowledge representation and reasoning, and attract the attention of the `temporal community' to a number of interesting open problems. |
| Decidable and undecidable fragments of first-order branching temporal logics |
| Citations: A decidable class of bounded recursions - Naughton, Sagiv (ResearchIndex) (980 words) |
| Another corollary of the two theorems is that stability of a query with conjuncts and disjuncts is also decidable, since such a query can be translated into an equivalent UCQ. |
| A decidability undecidability border, for cases of different syntactical restrictions and semantical assumptions has been studied in many papers, including [S85] CK86] A89] CGKV88] GMSV93] HKMV91] V88] and [W95] The syntactical restrictions considered were: number of recursive rules.... |
| The decidability undecidability border, for cases of different syntactical restrictions and semantical assumptions has been studied in [20] 5] 2] 6] 8] 9] 24] 23] The syntactical restrictions considered were: number of rules or of recursive rules in the program, maximal arity of.... |
Feeds |
Contact