Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
An interval logic for space based on “connection”
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Maintaining knowledge about temporal intervals
Communications of the ACM
Using Orientation Information for Qualitative Spatial Reasoning
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
When Tables Tell It All: Qualitative Spatial and Temporal Reasoning Based on Linear Orderings
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
Hi-index | 0.00 |
We define, in this paper, for every n ≥ 1, n-dimensional block algebra as a set of relations, the block relations, together with the fundamental operations of composition, conversion and intersection. We examine the 13n atomic relations of this algebra which constitute the exhaustive list of the permitted relations that can hold between two blocks whose sides are parallel to the axes of some orthogonal basis in the n-dimensional Euclidean space over the field of real numbers. We organize these atomic relations in ascending order with the intention of defining the concept of convexity as well as the one of preconvexity. We will confine ourselves to the issue of the consistency of block networks which consist of sets of constraints between a finite number of blocks. Showing that the concepts of convexity and preconvexity are preserved by the fundamental operations, we prove the tractability of the problem of the consistency of strongly preconvex block networks, on account of our capacity for deciding it in polynomial time by means of the path-consistency algorithm.