Skip to main content
SpringerLink
Log in

Determining Consistency of Topological Relations

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

This paper examines the problem of testing consistency of sets of topological relations which are instances of the RCC-8 relation set Leeds92a. Representations of these relations as constraints within a number of logical frameworks are considered. It is shown that, if the arguments of the relations are interpreted as non-empty open sets within an arbitrary topological space, a complete consistency checking procedure can be provided by means of a composition table. This result is contrasted with the case where regions are required to be planar and bounded by Jordan curves, for which the consistency problem is known to be NP-hard.

In order to investigate the completeness of compositional reasoning, the notion of k-compactness of a set of relations w.r.t. a theory is introduced. This enables certain consistency properties of relational networks to be examined independently of any specific interpretation of the domain of entities constrained by the relations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. F. Allen. (1981). An interval-based representation of temporal knowledge. Proceedings 7th IJCAI, pages 221–226.

  2. J. F. Allen. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM 26: 832–843.

    Article  Google Scholar 

  3. B. Bennett. (1994). Spatial reasoning with propositional logics. In J. Doyle, E. Sandewall and P. Torasso (eds), Principles of Knowledge Representation and Reasoning: Proceedings of the 4th International Conference (KR94), Morgan Kaufmann, San Francisco, CA.

    Google Scholar 

  4. B. Bennett. (1996a). Carving-up space: steps towards construction of an absolutely complete theory of spatial regions. Proceedings of JELIA'96.

  5. B. Bennett. (1996b). Modal logics for qualitative spatial reasoning. Bulletin of the Interest Group in Pure and Applied Logic (IGPL).

  6. B. Bennett, A. Isli, & A. G. Cohn. (1997). When does a composition table provide a complete and tractable proof procedure for a relational constraint language? Proceedings of the IJCAI-97 workshop on Spatial and Temporal Reasoning, Nagoya, Japan.

  7. M. Egenhofer & R. Franzosa. (1991). Point-set topological spatial relations. International Journal of Geographical Information Systems 5(2): 161–174.

    Google Scholar 

  8. M. Grigni, D. Papadias, & C. Papadimitriou. (1995). Topological inference. In C. Mellish (ed.), Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. I, Morgan Kaufmann, pages 901–906.

  9. J. Hudelmaier. (1993). An O(n log n)-space decision procedure for intuitionistic propositional logic. Journal of Logic and Computation 3: 63–75.

    Google Scholar 

  10. J. Kratochvíl. (1991). String graphs ii: recognizing string graphs is np-hard. Journal of Combinatorial Theory, Series B 52: 67–78.

    Google Scholar 

  11. S. Kripke. (1965). Semantical analysis of intuitionistic logic i. In J. Crossley and M. Dummett (eds), Formal Systems and Recursive Functions, North-Holland, pages 92–130.

  12. P. Ladkin & R. Maddux, (1994), On binary constraint problems. Journal of the ACM 41: 435–469.

    Google Scholar 

  13. A. Mackworth. (1977). Consistency in networks of relations. Artificial Intellegence 8: 99–118.

    Google Scholar 

  14. J. McKinsey & A. Tarski. (1944). The algebra of topology. Annals of Methematics 45: 141–191.

    Google Scholar 

  15. B. Nebel. (1995a). Computational properties of qualitative spatial reasoning: First results. Procedings of the 19th German AI Conference.

  16. B. Nebel. (1995b). Reasoning about temporal relations: a maximal tractable subset of Allen's interval algebra. Journal of the Association for Computing Machinery 42: 43–66.

    Google Scholar 

  17. A. Nerode. (1990). Some letcures on intuitionistic logic. In S. Homer, A. Nerode, R. Platek, G. Sacks, and A. Scedrov (eds), Logic and Computer Science, Vol. 1429 of Lecture Notes in Mathematics, Springer-Verlag, pages 12–59.

  18. D. A. Randell, Z. Cui, & A. G. Cohn. (1992). A spatial logic based on regions and connection. Proc. 3rd Int. Conf. on Knowledge Representation and Reasoning, Morgan Kaufmann, San Mateo, pages 165–176.

    Google Scholar 

  19. J. Renz & B. Nebel. (1997). On the complexity of qualitative spatial reasoning: a maximal tractable fragment of the Region Connection Calculus. Proceedings of IJCAI-97.

  20. A. Tarski. (1938). Der Aussagenkalkül und die Topologie [sentential calculus and topology]. Fundamenta Mathematicae 31: 103–134. English translation in A. Tarski, Logic, Semantics, Metamathematics. Oxford Clarendon Press, 1956.

    Google Scholar 

  21. M. Vilain & H. Kautz. (1986). Constraint propagation algorithms for temporal reasoning. Proceedings of the 5th AAAI conference, Philadelphia, pages 377–382.

Download references

Author information

Authors and Affiliations

  1. School of Computer Studies, The University of Leeds, LS2 9JT, UK

    Brandon Bennett

Authors
  1. Brandon Bennett
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bennett, B. Determining Consistency of Topological Relations. Constraints 3, 213–225 (1998). https://doi.org/10.1023/A:1009729828056

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009729828056

Search

Navigation