Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Introduction to Algorithms
Qualitative and Topological Relationships in Spatial Databases
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
Computational Properties of Qualitative Spatial Reasoning: First Results
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Composing cardinal direction relations
Artificial Intelligence
On Topological Consistency and Realization
Constraints
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
A new tractable subclass of the rectangle algebra
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Maximal tractable fragments of the region connection calculus: a complete analysis
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Combining topological and directional information for spatial reasoning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Toward a geometry of common sense: a semantics and a complete axiomatization of mereotopology
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
RCC8 binary constraint network can be consistently extended
Artificial Intelligence
Reasoning with lines in the Euclidean space
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On generalized interval calculi
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
| Hi-index | 5.23 |
In this paper, we solve the problem of determining a consistent instantiation of any finite, path-consistent and atomic network of RCC8 base relations. We already know that such networks that contain a finite number of variables have a realization in any dimension d=1. The novelty of our work is that given any path-consistent and atomic constraint RCC8 network, we are able to construct in polynomial time a realization that satisfies it. For this purpose, we suitably instantiate the variables of such a network by associating to them some regular closed sets of the set of real numbers.