A formal definition of binary topological relationships
3rd International Conference, FODO 1989 on Foundations of Data Organization and Algorithms
Maintaining knowledge about temporal intervals
Communications of the ACM
Combining topological and size information for spatial reasoning
Artificial Intelligence
Reasoning About Spatial Relationships in Picture Retrieval Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Computing Transivity Tables: A Challenge For Automated Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Integrated spatial reasoning in geographic information systems: combining topology and direction
Integrated spatial reasoning in geographic information systems: combining topology and direction
Composing cardinal direction relations
Artificial Intelligence
Cardinal directions between spatial objects: the pairwise-consistency problem
Information Sciences—Informatics and Computer Science: An International Journal
| Hi-index | 0.00 |
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. Although much work has been done in developing composition tables for these formalisms, the previous research for integrating heterogeneous formalisms was not sufficient. Instead of using conventional composition tables, we investigate the interactions between topological and cardinal directional relations with the aid of rules that are used efficiently in many research fields such as content-based image retrieval. These rules are shown to be sound, i.e. the deductions are logically correct. 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 constraint satisfaction problems based on various subsets of this hybrid formalism are presented at the end of this article.