The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
A new approach to cyclic ordering of 2D orientations using ternary relation algebras
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Spatial Reasoning About Points in a Multidimensional Setting
Applied Intelligence
Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning
Applied Intelligence
Determining Consistency of Topological Relations
Constraints
Combining Topological and Qualitative Size Constraints for Spatial Reasoning
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Computational Properties of Qualitative Spatial Reasoning: First Results
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
An Automata-Theoretic Approach to Constraint LTL
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Qualitative spatiotemporal representation and reasoning: a computational perspective
Exploring artificial intelligence in the new millennium
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
LTL Over integer periodicity constraints
Theoretical Computer Science
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of qualitative Z constraints
Theoretical Computer Science
An Automata-based Approach for CTL*; With Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
A tableau algorithm for description logics with concrete domains and GCIs
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
We consider the language obtained by mixing the model of the regions and the propositional linear temporal logic. In particular, we propose alternative languages where the model of the regions is replaced by different forms of qualitative spatial or temporal reasoning. In these languages, qualitative formulas describe the movement and the relative positions of spatial or temporal entities in some spatial or temporal universe. This paper addresses the issue of the formal proof that for all forms of qualitative spatial and temporal reasoning such that consistent atomic constraint satisfaction problems are globally consistent, determining of any given qualitative formula whether it is satisfiable or not is PSPACE-complete.