Abstract
While the computational properties of qualitative temporal reasoning have been analyzed quite thoroughly, the computational properties of qualitative spatial reasoning are not very well investigated. In fact, almost no completeness results are known for qualitative spatial calculi and no computational complexity analysis has been carried out yet. In this paper, we will focus on the so-called RCC approach and use Bennett's encoding of spatial reasoning in intuitionistic logic in order to show that consistency checking for the topological base relations can be done efficiently. Further, we show that path-consistency is sufficient for deciding global consistency. As a side-effect we prove a particular fragment of propositional intuitionistic logic to be tractable.
This research was partially supported by the European Commission as part of DRUMS-II, the ESPRIT Basic Research Project P6156.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, Nov. 1983.
B. Bennett. Spatial reasoning with propositional logic. In J. Doyle, E. Sandewall, and P. Torasso, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 4th International Conference, pages 51–62, Bonn, Germany, May 1994. Morgan Kaufmann.
B. Bennett. Modal logics for qualitative spatial reasoning. Bulletin of the IGPL, 1995. To appear.
M. J. Egenhofer. Reasoning about binary topological relations. In O. Günther and H.-J. Schek, editors, Proceedings of the Second Symposium on Large Spatial Databases, SSD'91, volume 525 of Lecture Notes in Computer Science, pages 143–160. Springer-Verlag, Berlin, Heidelberg, New York, 1991.
C. Habel, editor. KI 4/93 (Themenheft: Räumliche Repräsentation und räumliches SchlieΒen). 1993.
D. Hernandez. Qualitative Representation of Spatial Knowledge, volume 804 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, 1994.
J. Hudelmaier. An O(n log n)-space decision procedure for intuitionistic propositional logic. Journal for Logic and Computation, 3(1):63–75, 1993.
D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 67–161. MIT Press, 1990.
S. Kripke. Semantical analysis of intuitionistic logic I. In J. N. Crossley and M. Dummett, editors, Formal Systems and Recursive Functions, pages 92–130. North-Holland, Amsterdam, Holland, 1965.
A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
U. Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Science, 7:95–132, 1974.
B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, pages 356–361, Seattle, WA, July 1994. MIT Press. Extended version to appear in JACM.
A. Nerode. Some lectures on intuitionistic logic. In S. Homer, A. Nerode, R. A. Platek, G. E. Sacks, and A. Scedrov, editors, Logic and Computer Science, volume 1429 of Lecture Notes in Mathematics, pages 12–59. Springer-Verlag, Berlin, Heidelberg, New York, 1990.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
D. A. Randell and A. G. Cohn. Modelling topological and metrical properties of physical processes. In R. Brachman, H. J. Levesque, and R. Reiter, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 1st International Conference, pages 55–66, Toronto, ON, May 1989. Morgan Kaufmann.
D. A. Randell, A. G. Cohn, and Z. Cui. Computing transitivity tables: A challenge for automated theorem provers. In Proceedings of the 11th CADE. Springer-Verlag, 1992.
D. A. Randell, Z. Cui, and A. G. Cohn. A spatial logic based on regions and connection. In B. Nebel, W. Swartout, and C. Rich, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference, pages 165–176, Cambridge, MA, Oct. 1992. Morgan Kaufmann.
A. Tarski. What is elementary geometry? In L. Brouwer, E. Beth, and A. Heyting, editors, The Axiomatic Method, pages 16–29. North-Holland, Amsterdam, Holland, 1959.
P. van Beek and R. Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132–144, 1990.
M. B. Vilain and H. A. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the 5th National Conference of the American Association for Artificial Intelligence, pages 377–382, Philadelphia, PA, Aug. 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nebel, B. (1995). Computational properties of qualitative spatial reasoning: First results. In: Wachsmuth, I., Rollinger, CR., Brauer, W. (eds) KI-95: Advances in Artificial Intelligence. KI 1995. Lecture Notes in Computer Science, vol 981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60343-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-60343-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60343-6
Online ISBN: 978-3-540-44944-7
eBook Packages: Springer Book Archive