Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Introduction to reasoning about cyclic intervals
IEA/AIE '99 Proceedings of the 12th international conference on Industrial and engineering applications of artificial intelligence and expert systems: multiple approaches to intelligent systems
Maintaining knowledge about temporal intervals
Communications of the ACM
Spatial Reasoning About Points in a Multidimensional Setting
Applied Intelligence
’’Corner‘‘ Relations in Allen‘s algebra
Constraints
A New Framework for Reasoning about Points, Intervals and Durations
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reasoning about Generalized Intervals: Horn Representability and Tractability
TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)
Reasoning about temporal relations : the tractable subalgebras of Allen''''s interval algebra
Reasoning about temporal relations : the tractable subalgebras of Allen''''s interval algebra
Reasoning about temporal constraints: classifying the complexity in Allen''''s algebra by using an algebraic technique
The logic of time representation
The logic of time representation
Towards a complete classification of tractability in Allen's algebra
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A spatial odyssey of the interval algebra: 1. directed intervals
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Qualitative design support for engineering and architecture
Advanced Engineering Informatics
Categorical methods in qualitative reasoning: the case for weak representations
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
Floor plan design using block algebra and constraint satisfaction
Advanced Engineering Informatics
Hi-index | 0.00 |
Many formalisms for qualitative spatial and temporal reasoning fit into a pattern exemplified by Allen's temporal interval calculus. Constraint-based reasoning using Allen's calculus can benefit from some of its main properties: (a) the underlying constraint algebra is a relation algebra, in Tarski's sense: (b) testing path-consistency is a complete method for testing consistency for well-determined subclasses of relations: (c) atomic path-consistent networks are consistent and determine unique qualitative configurations; (d) the first order theory associated to the calculus is aleph-zero categorical. When considering analogous calculi, many of the properties mentioned above no longer hold. The main object of this paper is to examine some of the new questions which arise. In order to do so, we use the idea of weak representations of the algebras as a unifying concept.