Handbook of theoretical computer science (vol. B)
A propositional modal logic of time intervals
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Sharpening the Undecidability of Interval Temporal Logic
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Tableaux for Logics of Subinterval Structures over Dense Orderings
Journal of Logic and Computation
A decidable spatial logic with cone-shaped cardinal directions
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Weak MSO with the Unbounding Quantifier
Theory of Computing Systems
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Interval temporal logics provide a general frame-work for temporal representation and reasoning, where classical (point-based) linear temporal logics can be recovered as special cases. In this paper, we study the effects of the addition of an equivalence relation ~ to one of the most representative interval temporal logics, namely, the logic ?????? 炉 of Allen's relations meets, begun by, and begins. We first prove that the satisfiability problem for the resulting logic ?????? 炉 ~ remains decidable over finite linear orders, but it becomes nonprimitive recursive, while decidability is lost over N. We also show that decidability over N can be recovered by restricting to a suitable subset of models. Then, we show that ?????? 炉 ~ is expressive enough to define ????-regular languages, thus establishing a promising connection between interval temporal logics and extended ??-regular languages.