Combining topological and qualitative size constraints for spatial reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1520, Issue , 1998, Pages 220-234

  Gerevini, Alfonso ^a   Renz, Jochen ^b  

^a UNIVERSITY OF BRESCIA   (Italy)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

NOVEL TECHNIQUES; PATH CONSISTENCY; QUALITATIVE SPATIAL REASONING; REGION CONNECTION CALCULUS; SPATIAL INFORMATIONS; SPATIAL REASONING; TOPOLOGICAL CONSTRAINTS; TOPOLOGICAL RELATIONS;

TOPOLOGY;

EID: 84856473151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_17     Document Type: Conference Paper

References (17)

1. J.F. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(1):832-843, 1983.
2. T. Apostol. Mathematical Analysis. Addison Wesley, 1974.
3. C. Bessière. A simple way to improve path-consistency in Interval Algebra networks. In Proc. AAAI-96, pages 375-380, 1996.
4. R. Dechter. From local to global consistency. Artificial Intelligence, 55:87-108, 1992.
5. A. Gerevini and J. Renz. Combining topological and qualitative size constraints for spatial reasoning. Technical report. To appear.
6. A. Gerevini and L. Schubert. On computing the minimal labels in time point algebra networks. Computational Intelligence, 11(3):443-448, 1995.
7. M. C. Golumbic and R. Shamir. Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of the Association for Computing Machinery, 40(5):1128-1133, November 1993.
8. H. A. Kautz and P.B. Ladkin. Integrating metric and qualitative temporal reasoning. In Proc. AAAI-91, pages 241-246, 1991.
9. P. B. Ladkin and R. Maddux. On binary constraint networks. Technical Report KES.U.88.8, Kestrel Institute, Palo Alto, CA, 1988.
10. G. Ligozat. A new proof of tractability for Ord-Horn relations. In Proc. AAAI-96, pages 715-720, 1996.
11. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
12. A. K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65-73, 1985.
13. D. A. Randell, Z. Cui, and A.G. Cohn. A spatial logic based on regions and connection. In Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR’92), pages 165-176, 1992.
14. J. Renz. A canonical model of the Region Connection Calculus. In Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference (KR’98), pages 330-341, 1998.
15. J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. In Proc. IJ- CAI’97, pages 522-527, 1997. Technical Report with full proofs available at www.informatik.uni-freiburg.de/~sppraum.
16. P. van Beek. Reasoning about qualitative temporal information. Artificial Intelligence, 58(1-3):297-321, 1992.
17. M. Vilain, H.A. Kautz, and P. van Beek. Constraint propagation algorithms for temporal reasoning: a revised report. In D. SWeld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 373-381. Morgan Kaufmann, San Mateo, CA, 1990.