TY - GEN
T1 - Combining topological and qualitative size constraints for spatial reasoning
AU - Gerevini, Alfonso
AU - Renz, Jochen
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - Information about the relative size of spatial regions is often easily accessible and, when combined with other types of spatial information, it can be practically very useful. In this paper we combine a simple framework for reasoning about qualitative size relations with the Region Connection Calculus RCC-8, a widely studied approach for qualitative spatial reasoning with topological relations. Reasoning about RCC-8 relations is NP-hard, but a large maximal tractable subclass of RCC-8 called Ĥ8 was identified. Interestingly, any constraint in RCC-8 - Ĥ8 can be consistently reduced to a constraint in Ĥ8, when an appropriate size constraint between the spatial regions is supplied. We propose an O(n3) time path-consistency algorithm based on a novel technique for combining RCC-8 constraints and relative size constraints, where n is the number of spatial regions. We prove its correctness and completeness for deciding consistency when the input contains topological constraints in Ĥ8. We also provide results on finding a consistent scenario in O(n3) time both for combined topological and relative size constraints, and for topological constraints alone. This is an O(n2) improvement over the known methods.
AB - Information about the relative size of spatial regions is often easily accessible and, when combined with other types of spatial information, it can be practically very useful. In this paper we combine a simple framework for reasoning about qualitative size relations with the Region Connection Calculus RCC-8, a widely studied approach for qualitative spatial reasoning with topological relations. Reasoning about RCC-8 relations is NP-hard, but a large maximal tractable subclass of RCC-8 called Ĥ8 was identified. Interestingly, any constraint in RCC-8 - Ĥ8 can be consistently reduced to a constraint in Ĥ8, when an appropriate size constraint between the spatial regions is supplied. We propose an O(n3) time path-consistency algorithm based on a novel technique for combining RCC-8 constraints and relative size constraints, where n is the number of spatial regions. We prove its correctness and completeness for deciding consistency when the input contains topological constraints in Ĥ8. We also provide results on finding a consistent scenario in O(n3) time both for combined topological and relative size constraints, and for topological constraints alone. This is an O(n2) improvement over the known methods.
UR - http://www.scopus.com/inward/record.url?scp=84856473151&partnerID=8YFLogxK
U2 - 10.1007/3-540-49481-2_17
DO - 10.1007/3-540-49481-2_17
M3 - Conference contribution
AN - SCOPUS:84856473151
SN - 3540652248
SN - 9783540652243
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 220
EP - 234
BT - Principles and Practice of Constraint Programming – CP 1998 - 4th International Conference, CP 1998, Proceedings
A2 - Puget, Jean-Francois
A2 - Maher, Michael
PB - Springer Verlag
T2 - 4th International Conference on Principles and Practice of Constraint Programming, CP 1998
Y2 - 26 October 1998 through 30 October 1998
ER -