Although the computational properties of the Region Connection Calculus RCC-8 are well studied, reasoning with RCC-8 entails several representational problems. This includes the problem of representing arbitrary spatial regions in a computational framework, leading to the problem of generating a realization of a consistent set of RCC-8 constraints. A further problem is that RCC-8 performs reasoning about topological space, which does not have a particular dimension. Most applications of spatial reasoning, however, deal with two- or three-dimensional space. Therefore, a consistent (...) set of RCC-8 constraints might not be realizable within the desired dimension. In this paper we address these problems and develop a canonical model of RCC-8 which allows a simple representation of regions with respect to a set of RCC-8 constraints, and, further, enables us to generate realizations in any dimension d = 1. For three-and higher-dimensional space this can also be done for internally connected regions. (shrink)

In recent years, there has been renewed interest in the development of formal languages for describing mereological (part-whole) and topological relationships between objects in space. Typically, the non-logical primitives of these languages are properties and relations such as `x is connected' or `x is a part of y', and the entities over which their variables range are, accordingly, not points, but regions: spatial entities other than regions are admitted, if at all, only as logical constructs of regions. This paper considers (...) two first-order mereotopological languages, and investigates their expressive power. It turns out that these languages, notwithstanding the simplicity of their primitives, are surprisingly expressive. In particular, it is shown that infinitary versions of these languages are adequate to express (in a sense made precise below) all topological relations over the domain of polygons in the closed plane. (shrink)

In recent years, there has been renewed interest in the development of formal languages for describing mereological (part-whole) and topological relationships between objects in space. Typically, the non-logical primitives of these languages are properties and relations such as ‘xis connected’ or ‘xis a part ofy’, and the entities over which their variables range are, accordingly, notpoints, butregions: spatial entities other than regions are admitted, if at all, only as logical constructs of regions. This paper considers two first-order mereotopological languages, and (...) investigates their expressive power. It turns out that these languages, notwithstanding the simplicity of their primitives, are surprisingly expressive. In particular, it is shown that infinitary versions of these languages are adequate to express (in a sense made precise below) all topological relations over the domain of polygons in the closed plane. (shrink)

A region-based model of physical space is one in which the primitive spatial entities are regions, rather than points, and in which the primitive spatial relations take regions, rather than points, as their relata. Historically, the most intensively investigated region-based models are those whose primitive relations are topological in character; and the study of the topology of physical space from a region-based perspective has come to be called mereotopology. This paper concentrates on a mereotopological formalism originally introduced by Whitehead, which (...) employs a single primitive binary relation C(x, y) (read: "x is in contact with y"). Thus, in this formalism, all topological facts supervene on facts about contact. Because of its potential application to theories of qualitative spatial reasoning, Whitehead's primitive has recently been the subject of scrutiny from within the Artificial Intelligence community. Various results regarding the mereotopology of the Euclidean plane have been obtained, settling such issues as expressive power, axiomatization and the existence of alternative models. The contribution of the present paper is to extend some of these results to the mereotopology of three-dimensional Euclidean space. Specifically, we show that, in a first-order setting where variables range over tame subsets of ℝ³, Whitehead's primitive is maximally expressive for topological relations; and we deduce a corollary constraining the possible region-based models of the space we inhabit. (shrink)

A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topological relations and functions taking these subsets as arguments. Thus, topological constraint languages typically allow us to make assertions such as “region V1 touches the boundary of region V2”, “region V3 is connected” or “region V4 is a proper part of the closure of region V5”. A formula f in a topological constraint language is said to (...) be satisfiable if there exists an assignment to its variables of regions from some topological space under which φ is made true. This paper introduces a topological constraint language which, in addition to the usual mechanisms for expressing Boolean combinations of regions and their topological closures, includes primitives for bounding the number of components of a region. We call this language T CC, a rough acronym for “topological constraint language with component counting”. Our main result is that the problem of determining the satisfiability of a T CC-formula is NEXPTIME-complete. (shrink)

I argue that relations between non-collocated spatial entities, between non-identical topological spaces, and between non-identical basic building blocks of space, do not exist. If any spatially located entities are not at the same spatial location, or if any topological spaces or basic building blocks of space are non-identical, I will argue that there are no relations between or among them. The arguments I present are arguments that I have not seen in the literature.

Mereological nihilism is the philosophical position that there are no items that have parts. If there are no items with parts then the only items that exist are partless fundamental particles, such as the true atoms (also called philosophical atoms) theorized to exist by some ancient philosophers, some contemporary physicists, and some contemporary philosophers. With several novel arguments I show that mereological nihilism is the correct theory of reality. I will also discuss strong similarities that mereological nihilism has with empirical (...) results in quantum physics. And I will discuss how mereological nihilism vindicates a few other theories, such as a very specific theory of philosophical atomism, which I will call quantum abstract atomism. I will show that mereological nihilism also is an interpretation of quantum mechanics that avoids the problems of other interpretations, such as the widely known, metaphysically generated, quantum paradoxes of quantum physics, which ironically are typically accepted as facts about reality. I will also show why it is very surprising that mereological nihilism is not a widely held theory, and not the premier theory in philosophy. (shrink)

Contact relations have been studied in the context of qualitative geometry and physics since the early 1920s, and have recently received attention in qualitative spatial reasoning. In this paper, we present a sound and complete proof system in the style of Rasiowa and Sikorski (1963) for relation algebras generated by a contact relation.

The standard model for mereotopological structures are Boolean subalgebras of the complete Boolean algebra of regular closed subsets of a nonempty connected regular T 0 topological space with an additional "contact relation" C defined by xCy x ØA (possibly) more general class of models is provided by the Region Connection Calculus (RCC) of Randell et al. We show that the basic operations of the relational calculus on a "contact relation" generate at least 25 relations in any model of the RCC, (...) and hence, in any standard model of mereotopology. It follows that the expressiveness of the RCC in relational logic is much greater than the original 8 RCC base relations might suggest. We also interpret these 25 relations in the the standard model of the collection of regular open sets in the two-dimensional Euclidean plane. (shrink)

The paper outlines a model-theoretic framework for investigating and comparing a variety of mereotopological theories. In the first part we consider different ways of characterizing a mereotopology with respect to (i) the intended interpretation of the connection primitive, and (ii) the composition of the admissible domains of quantification (e.g., whether or not they include boundary elements). The second part extends this study by considering two further dimensions along which different patterns of topological connection can be classified - the strength of (...) the connection and its multiplicity. (shrink)

We analyze and compare geometrical theories based on mereology (mereogeometries). Most theories in this area lack in formalization, and this prevents any systematic logical analysis. To overcome this problem, we concentrate on specific interpretations for the primitives and use them to isolate comparable models for each theory. Relying on the chosen interpretations, we introduce the notion of environment structure, that is, a minimal structure that contains a (sub)structure for each theory. In particular, in the case of mereogeometries, the domain of (...) an environment structure is composed of particular subsets of Rn. The comparison of mereogeometrical theories within these environment structures shows dependencies among primitives and provides (relative) definitional equivalences. With one exception, we show that all the theories considered are equivalent in these environment structures. (shrink)

The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discrete spaces. These modal logics are linguistic restrictions of propositional dynamic logic with the global diamond E. Their formulas are equivalent to Boolean combinations of modal formulas like E(A ∧ ⟨α⟩ B) where A and B are Boolean terms and α is a relational term. Examining what we can say (...) about dynamic models when we use formulas to describe them, we successively address the axiomatization/completeness issue and the decidability/complexity issue of our dynamic logics of the region-based theory of discrete spaces. (shrink)