Exact and approximate reasoning about temporal relations
Computational Intelligence
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Modern database systems
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
A general method for spatial reasoning in spatial databases
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Hierarchical constraint satisfaction in spatial databases
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Qualitative Representation of Spatial Knowledge
Qualitative Representation of Spatial Knowledge
Combining topological and size information for spatial reasoning
Artificial Intelligence
Fast algebraic methods for interval constraint problems
Annals of Mathematics and Artificial Intelligence
’’Corner‘‘ Relations in Allen‘s algebra
Constraints
Qualitative Representations in Large Spatial Databases
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Consistent Queries over Cardinal Directions Across Different Levels of Detail
DEXA '00 Proceedings of the 11th International Workshop on Database and Expert Systems Applications
Similarity assessment for cardinal directions between extended spatial objects
Similarity assessment for cardinal directions between extended spatial objects
Composing cardinal direction relations
Artificial Intelligence
Cardinal directions between spatial objects: the pairwise-consistency problem
Information Sciences—Informatics and Computer Science: An International Journal
Computing and Managing Cardinal Direction Relations
IEEE Transactions on Knowledge and Data Engineering
CHINZ '06 Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI
Modelling and solving temporal reasoning as propositional satisfiability
Artificial Intelligence
Table extraction using spatial reasoning on the CSS2 visual box model
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
On the consistency of cardinal direction constraints
Artificial Intelligence
Qualitative CSP, finite CSP, and SAT: comparing methods for qualitative constraint-based reasoning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Combining RCC-8 with qualitative direction calculi: algorithms and complexity
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Customizing qualitative spatial and temporal calculi
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Reasoning about cardinal directions between extended objects
Artificial Intelligence
SXPath: extending XPath towards spatial querying on web documents
Proceedings of the VLDB Endowment
Reasoning about cardinal directions between extended objects: The NP-hardness result
Artificial Intelligence
Qualitative Spatial Representation and Reasoning: An Overview
Fundamenta Informaticae - Qualitative Spatial Reasoning
The ontological key: automatically understanding and integrating forms to access the deep Web
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Qualitative spatial representation and reasoning plays a important role in various spatial applications. In this paper we introduce a new formalism, we name RCD calculus, for qualitative spatial reasoning with cardinal direction relations between regions of the plane approximated by rectangles. We believe this calculus leads to an attractive balance between efficiency, simplicity and expressive power, which makes it adequate for spatial applications. We define a constraint algebra and we identify a convex tractable subalgebra allowing efficient reasoning with definite and imprecise knowledge about spatial configurations specified by qualitative constraint networks. For such tractable fragment, we propose several polynomial algorithms based on constraint satisfaction to solve the consistency and minimality problems. Some of them rely on a translation of qualitative networks of the RCD calculus to qualitative networks of the Interval or Rectangle Algebra, and back. We show that the consistency problem for convex networks can also be solved inside the RCD calculus, by applying a suitable adaptation of the path-consistency algorithm. However, path consistency can not be applied to obtain the minimal network, contrary to what happens in the convex fragment of the Rectangle Algebra. Finally, we partially analyze the complexity of the consistency problem when adding non-convex relations, showing that it becomes NP-complete in the cases considered. This analysis may contribute to find a maximal tractable subclass of the RCD calculus and of the Rectangle Algebra, which remains an open problem.