Modelling topological and metrical properties in physical processes
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Boolean connection algebras: a new approach to the Region-Connection Calculus
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
A relation — algebraic approach to the region connection calculus
Theoretical Computer Science
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
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
Region connection calculus: its models and composition table
Artificial Intelligence
Extensionality of the RCC8 composition table
Fundamenta Informaticae
On Topological Consistency and Realization
Constraints
A representation theorem for Boolean contact algebras
Theoretical Computer Science
Generalized Region Connection Calculus
Artificial Intelligence
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
GNet: A generalized network model and its applications in qualitative spatial reasoning
Information Sciences: an International Journal
Combining binary constraint networks in qualitative reasoning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Combining topological and directional information for spatial reasoning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Event composition operators: ECO
EiMM '09 Proceedings of the 1st ACM international workshop on Events in multimedia
Hi-index | 0.00 |
The RCC8 constraint language developed by Randell et al. has been popularly adopted by the Qualitative Spatial Reasoning and GIS communities. The recent observation that RCC8 composition table describes only weak composition instead of composition raises questions about Renz and Nebel's maximality results about the computational complexity of reasoning with RCC8.This paper shows that any consistent RCC8 binary constraint network (RCC8 network for short) can be consistently extended. Given Θ, an RCC8 network, and z, a fresh variable, suppose xTy ∈ Θ and T is contained in the weak composition of R and S. This means that we can add two new constraints xRz and zSy to Θ without changing the consistency of the network. The result guarantees the applicability to RCC8 of one key technique, (Theorem 5) of [J. Renz, B. Nebel, On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence 108 (1999) 69-123], which allows the transfer of tractability of a set of RCC8 relations to its closure under composition, intersection, and converse.