Abstract
In this article, we investigate the problem of checking consistency in a hybrid formalism which combines two essential formalisms in qualitative spatial reasoning: topological formalism and cardinal direction formalism. First the general interaction rules are given, and then, based on these rules, an improved constraint propagation algorithm is introduced to enforce the path consistency. The results of computational complexity of checking consistency for CSPs based on various subsets of this hybrid formalism are presented at the end of this article.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
REFERENCES
A. Gerevini and J. Renz (2002), Combining topological and size constraints for spatial reasoning. Artificial Intelligence (AIJ), 137, 1–2, pp. 1–42.
A. Isli, V. Haarslev and R. Moller (2001), Combining cardinal direction relations and relative orientation relations in Qualitative Spatial Reasoning. Technical Report FBI-HH-M-304/01, Fachbereich Informatik, University Hamburg.
M. Egenhofer (1989), A formal definition of binary topological relationships. In: Third International Conference on Foundations of Data Organization and Algorithms (FODO), Paris, France.
R. Goyal and M. Egenhofer (2000), Cardinal directions between extended spatial objects. IEEE Transactions on Knowledge and Data Engineering. Available at http://www.spatial.maine.edu/~max/RJ36.html
D.A. Randell, A.G. Cohn and Z. Cui (1992), Computing transitivity tables: a challenge for automated theorem provers. In: Proceedings CADE 11, Springer Verlag, Berlin.
S. Skiadopoulos and M. Koubarakis (2004), Composing cardinal direction relations. Artificial Intelligence, 152, 2, pp. 143–171.
S. Cicerone and P. Di Felice (2004), Cardinal directions between spatial objects: the pairwise-consistency problem. Information Sciences, 164, pp. 165–188.
J.F. Allen (November 1983), Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 11, pp. 832–843.
J. Renz and B. Nebel (1999), On the complexity of qualitative spatial reasoning: a maximal tractable fragment of the region connection calculus. Artificial Intelligence (AIJ), 108, 1–2, pp. 69–123.
J. Renz (August 1999), Maximal tractable fragments of the region connection calculus: a complete analysis. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI’99), Stockholm, Sweden.
S. Skiadopoulos and M. Koubarakis (2002), Qualitative spatial reasoning with cardinal directions. In: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programing (CP’02), in Lecture Notes in Computer Science, Vol. 2470, Springer, Berlin, pp. 341–355.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Sun, H., Li, W., Zhang, Yj. (2006). CHECKING CONSISTENCY IN HYBRID QUALITATIVE SPATIAL REASONING. In: LIU, G., TAN, V., HAN, X. (eds) Computational Methods. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-3953-9_19
Download citation
DOI: https://doi.org/10.1007/978-1-4020-3953-9_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3952-2
Online ISBN: 978-1-4020-3953-9
eBook Packages: EngineeringEngineering (R0)