Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations
From MaRDI portal
Publication:2938489
DOI10.1007/978-3-319-11558-0_9zbMath1432.03028MaRDI QIDQ2938489
Guido Sciavicco, Emilio Muñoz-Velasco, Davide Bresolin
Publication date: 14 January 2015
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_9
Related Items
Unnamed Item, Unnamed Item, Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic, Computational complexity of hybrid interval temporal logics, On coarser interval temporal logics, Hybrid fragments of Halpern-Shoham logic and their expressive power
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- Duration calculus. A formal approach to real-time systems.
- The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
- The dark side of interval temporal logic: marking the undecidability border
- Temporal prepositions and their logic
- The Complexity of Clausal Fragments of LTL
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Tableaux for Logics of Subinterval Structures over Dense Orderings
- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals
- A note on the complexity of the satisfiability of modal Horn clauses
- The complexity of propositional linear temporal logics
- A propositional modal logic of time intervals
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Clausal resolution for normal modal logics
- Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification
