Maintaining knowledge about temporal intervals
Communications of the ACM
Spatial and Temporal Reasoning
Spatial and Temporal Reasoning
Handbook of Spatial Logics
A new modal logic for reasoning about space: spatial propositional neighborhood logic
Annals of Mathematics and Artificial Intelligence
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The Complexity of Satisfiability for Fragments of CTL and CTL*;
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
Electronic Notes in Theoretical Computer Science (ENTCS)
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
B and D are enough to make the Halpern-Shoham logic undecidable
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce a spatial modal logic based on cone-shaped cardinal directions over the rational plane and we prove that, unlike projection-based ones, such as, for instance, Compass Logic, its satisfiability problem is decidable (PSPACE-complete). We also show that it is expressive enough to subsume meaningful interval temporal logics, thus generalizing previous results in the literature, e.g., its decidability implies that of the subinterval/superinterval temporal logic interpreted over the rational line.