ON BEGINS, MEETS AND BEFORE
From MaRDI portal
Publication:2909218
DOI10.1142/S012905411240028XzbMath1259.03028OpenAlexW2119006311MaRDI QIDQ2909218
Davide Bresolin, Guido Sciavicco, Pietro Sala
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905411240028x
complexitydecidabilitysatisfiabilityinterval temporal logicdecision procedurestrongly discrete linear models
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items (max. 100)
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases ⋮ On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders ⋮ Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
Cites Work
- Maintaining knowledge about temporal intervals
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- Expressiveness and completeness of an interval tense logic
- Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings
This page was built for publication: ON BEGINS, MEETS AND BEFORE
