This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexander, J.W. (1924a). An example of a simply connected surface bounding a region which is not simply connected. Proceedings of the National Academy of Sciences of the United States of America, 10(1):8–10.
Alexander, J.W. (1924b). On the subdivision of 3-space by a polyhedron. Proceedings of the National Academy of Sciences of the United States of America, 10(1):6–8.
Biacino, L. and Gerla, G. (1991). Connection structures. Notre Dame Journal of Formal Logic, 32(2):242–247.
Bochnak, J., Coste, M., and Roy, M.-F. (1998). Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete, 3, Folge. Springer Berlin.
Cantone, D. and Cutello, V. (1994). Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness and cardinailty composition. Communications on Pure and Applied Mathematics, XLVII:1197–1217.
Chang, C.C. and Keisler, H.J. (1990). Model Theory. North Holland, Amsterdam, 3rd edition.
Clarke, B.L. (1981). A calculus of individuals based on “connection”. Notre Dame Journal of Formal Logic, 22(3):204–218.
Clarke, B.L. (1985). Individuals and points. Notre Dame Journal of Formal Logic, 26(1):61–75.
Davis, E., Gotts, N.M., and Cohn, A.G. (1999). Constraint networks of topological relations and convexity. Constraints, 4(3):241–280.
de Laguna, T. (1922a). The nature of space–I. The Journal of Philosophy, 19:393–407.
de Laguna, T. (1922b). The nature of space–II. The Journal of Philosophy, 19:421–440.
de Laguna, T. (1922c). Point, line, and surface as sets of solids. The Journal of Philosophy, 19:449–461.
Diestel, R. (1991). Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer, New York.
Dimov, G. and Vakarelov, D. (2006). Contact algebras and relation-based theory of space: a proximity approach I. Fundamenta Informaticae, 74:209–249.
Dornheim, C. (1998). Undecidability of plane polygonal mereotopology. In Cohn, A.G., Schubert, L.K., and Schubert, S.C., editors, Principles of Knowledge Representation and Reasoning: Proc. 6th International Conference (KR ‘98), pages 342–353. Morgan Kaufmann, San Francisco.
Düntsch, I. and Winter, M. (2005). A representation theorem for Boolean contact algebras. Theoretical Computer Science, 347:498–512.
Egenhofer, M.J. (1991). Reasoning about binary topological relations. In Günther, O. and Schek, H.-J., editors, Advances in Spatial databases, SSD ‘91 Proceedings, volume 525 of Lecture Notes in Computer Science, pages 143–160. Springer, Berlin.
Erlich, G., Even, S., and Tarjan, R.E. (1976). Intersection graphs of curves in the plane. Journal of Combinatorial Theory B, 21:8–20.
Gotts, N.M., Gooday, J.M., and Cohn, A.G. (1996). A connection based approach to commonsense topological description and reasoning. Monist, 79(1): 51–75.
Hodges, W. (1993). Model Theory, volume 42 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge.
Kelley, J.L. (1955). General Topology, volume 27 of Graduate Texts in Mathematics. Springer, New York.
Koppelberg, S. (1989). Handbook of Boolean Algebras, volume 1. North-Holland, Amsterdam.
Kratochvíl, J. (1988). String graphs II: Recognizing string graphs is NP-hard. Journal of Combinatorial Theory B, 52:67–78.
Kuijpers, B., Paradaens, J., and van den Bussche, J. (1995). Lossless representation of topological spatial data. In Egenhofer, M.J. and Herring, J.R., editors, Proc. 4th International Symposium on Large Spatial Databases, volume 951 of Lecture Notes in Computer Science, pages 1–13. Springer, Berlin.
Massey, W.S. (1967). Algebraic Topology : an Introduction. Harcourt, Brace & World, New York.
Moise, E. (1977). Geometric Topology in Dimensions 2 and 3, volume 47 of Graduate Texts in Mathematics. Springer, New York.
Newman, M.H.A. (1964). Elements of the Topology of Plane Sets of Points. Cambridge University Press, Cambridge.
Nutt, W. (1999). On the translation of qualitative spatial reasoning problems into modal logics. In Burgard, W., Christaller, T., and Cremers, A., editors, Advances in Artificial Intelligence, Proc. 23rd Annual German Conference on Artificial Intelligence, KI’99, volume 1701 of Lecture Notes in Computer Science, pages 113–124, Springer, Berlin.
Papadimitriou, C.H., Suciu, D., and Vianu, V. (1999). Topological queries in spatial databases. Journal of Computer and System Sciences, 58(1):29–53.
Pratt, I. (1999). First-order spatial representation languages with convexity. Spatial Cognition and Computation, 1:181–204.
Pratt, I. and Lemon, O. (1997). Ontologies for plane, polygonal mereotopology. Notre Dame Journal of Formal Logic, 38(2):225–245.
Pratt, I. and Schoop, D. (1998). A complete axiom system for polygonal mereotopology of the real plane. Journal of Philosophical Logic, 27(6):621–658.
Pratt, I. and Schoop, D. (2000). Expressivity in polygonal, plane mereotopology. Journal of Symbolic Logic, 65(2):822–838.
Pratt, I. and Schoop, D. (2002). Elementary polyhedral mereotopology. Journal of Philosophical Logic, 31:461–498.
Pratt-Hartmann, I. (2002). A topological constraint language with component counting. Journal of Applied Non-Classical Logics, 12(3–4):441–467.
Randell, D.A., Cui, Z., and Cohn, A.G. (1992). A spatial logic based on regions and connection. In Nebel, B., Rich, C., and Swartout, W., editors, Principles of Knowledge Representation and Reasoning: Proc. 3rd International Conference (KR ‘92), pages 165–176. Morgan Kaufmann, San Francisco.
Renz, J. and Nebel, B. (1997). On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. In Proc. 15th International Joint Conference on Artificial Intelligence (IJCAI 97), pages 522–527. Morgan Kaufmann, San Francisco.
Roeper, P. (1997). Region-based topology. Journal of Philosophical Logic, 26:251–309.
Rudin, M.E. (1958). An unshellable triangulation of a tetrahedron. Bulletin of the American Mathematical Society, 64:90–91.
Schaefer, M., Sedgwick, E., and Štefankovič, D. (2003). Recognizing string graphs in NP. Journal of Computer and System Sciences, 67:365–380.
Schaefer, M. and Štefankovič, D. (2004). Decidability of string graphs. Journal of Computer and System Sciences, 68:319–334.
Schoop, D. (1999). A Logical Approach to Mereotopology. PhD thesis, Department of Computer Science, University of Manchester, Manchester, England.
Simons, P. (1987). Parts: a Study in Ontology. Clarendon Press, Oxford.
Steen, L.A. and Seebach, J.A. (1995). Counterexamples in Topology. Dover Publications, New York.
Tarski, A. (1956). Foundations of the geometry of solids. In Logic, Semantics and Metamathematics, pages 24–29. Clarendon Press, Oxford.
van den Dries, L. (1998). Tame Topology and O-Minimal Structures, volume 248 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge.
Whitehead, A.N. (1919). An Enquiry Concerning the Principles of Natural Knowledge. Cambridge University Press, Cambridge.
Whitehead, A.N. (1920). The Concept of Nature. Cambridge University Press, Cambridge.
Whitehead, A.N. (1929). Process and Reality. The MacMillan Company, New York.
Wilson, R.J. (1979). Introduction to Graph Theory. Longman, London.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Pratt-Hartmann, I. (2007). First-Order Mereotopology. In: Aiello, M., Pratt-Hartmann, I., Van Benthem, J. (eds) Handbook of Spatial Logics. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-5587-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4020-5587-4_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-5586-7
Online ISBN: 978-1-4020-5587-4
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)