We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-structure in spatial patterns which suggests analogies across these mathematical theories in terms of modal, temporal, and conditional logics. Throughout the modal walk through space, expressive power is analyzed in terms of language design, bisimulations, and correspondence phenomena. The result is both unification across the areas visited, and the uncovering of interesting new questions.

We approach the semantics of prepositions from the perspective of conceptual spaces. Focusing on purely spatial locative and directional prepositions, we analyze both types of prepositions in terms of polar coordinates instead of Cartesian coordinates. This makes it possible to demonstrate that the property of convexity holds quite generally in the domain of prepositions of location and direction, supporting the important role that this property plays in conceptual spaces.

Mereotopology is a theory of connected parts. The existence of boundaries, as parts of everyday objects, is basic to any such theory; but in classical mereotopology, there is a problem: if boundaries exist, then either distinct entities cannot be in contact, or else space is not topologically connected . In this paper we urge that this problem can be met with a paraconsistent mereotopology, and sketch the details of one such approach. The resulting theory focuses attention on the role of (...) empty parts, in delivering a balanced and bounded metaphysics of naive space. (shrink)

We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the comparison and combination of logics from distinct research traditions such as Tarski’s for topological closure and interior, conditional logics, and logics of comparative similarity. This framework is obtained by decomposing the underlying modal-like operators into first-order quantifier patterns. We then show that quite a powerful and natural fragment of the resulting first-order logic can be (...) captured by one binary operator comparing distances between sets and one unary operator distinguishing between realised and limit distances . Due to its greater expressive power, this logic turns out to behave quite differently from both and conditional logics. We provide finite axiomatisations and ExpTime-completeness proofs for the logics of various classes of distance spaces, in particular metric spaces. But we also show that the logic of the real line is not recursively enumerable. This result is proved by an encoding of Diophantine equations. (shrink)

This paper describes methods for generating interactive Euler diagrams. User interaction is needed to improve the aesthetic quality of the drawing without writing tedious formal specifications. More precisely, the user can modify the diagram’s layout on the fly by mouse control. We prove that the satisfiability problem is in \ and we provide two syntactic fragments such that the corresponding restricted satisfiability problem is already \-hard. We describe an improved local search based approach, a method inspired from the gradient method (...) and a hybrid method mixing both and. A software tool was implemented and its implementation is described. We also experimentally compare the different methods. We first see that the improved local search and the hybrid method outperforms the local search from the literature and the gradient method for generating a diagram. Concerning interaction, the local search approach is not suitable but hybrid method and gradient method give both good results in terms of quality of drawings and stability. Specifications are written using region connection calculus ), radius constraints and disjunctions. Euler diagrams are described as set of circles. (shrink)

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)

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)

We show that a standard axiomatization of mereology is equivalent to the condition that a topological space is discrete, and consequently, any model of general extensional mereology is indistinguishable from a model of set theory. We generalize these results to the Cartesian closed category of convergence spaces.

Categorization is fundamental for spatial and motion representation in both the domain of artificial intelligence and human cognition. In this paper, we investigated whether motion categorizations designed in artificial intelligence can inform human cognition. More concretely, we investigated if such categorizations (also known as qualitative representations) can inform the psychological understanding of human perception and memory of motion scenes. To this end, we took two motion categorizations in artificial intelligence, Motion‐RCC and Motion‐OPRA1, and conducted four experiments on human perception and (...) memory. Participants viewed simple motion scenes and judged the similarity of transformed scenes with this reference scene. Those transformed scenes differed in none, one, or both Motion‐RCC and Motion‐OPRA1 categories. Importantly, we applied an equal absolute metric change to those transformed scenes, so that differences in the similarity judgments should be due only to differing categories. In Experiments 1a and 1b, where the reference stimulus and transformed stimuli were visible at the same time (perception), both Motion‐OPRA1 and Motion‐RCC influenced the similarity judgments, with a stronger influence of Motion‐OPRA1. In Experiments 2a and 2b, where participants first memorized the reference stimulus and viewed the transformed stimuli after a short blank (memory), only Motion‐OPRA1 had marked influences on the similarity judgments. Our findings demonstrate a link between human cognition and these motion categorizations developed in artificial intelligence. We argue for a continued and close multidisciplinary approach to investigating the representation of motion scenes. (shrink)

Mereotopology is the discipline obtained from combining topology with the formal study of parts and their relation to wholes, or mereology. This article develops a mereotopological theory of time, illustrating how different temporal topologies can be effectively discriminated on this basis. Specifically, we demonstrate how the three principal types of temporal models—namely, the linear ones, the forking ones, and the circular ones—can be characterized by differently combining two sole mereotopological constraints: one to denote the absence of closed loops, and the (...) other one to denote the absence of branches. (shrink)

The discovery of the importance of mereology follows and does not precede the formalisation of the theory. In particular, it was only after the construction of an axiomatic theory of the part-whole relation by the Polish logician Stanisław Leśniewski that any attempt was made to reinterpret some periods in the history of philosophy in the light of the theory of parts and wholes. Secondly, the push for formalisation - and the individuation of mereology as a specific theoretical field - arise (...) from several particular theories, first from biology and then from psychology. Mereological considerations were explicitly developed within the school of Brentano, by Brentano himself- starting from the problem of the unity of consciousness - and by his students, particularly Stumpl, Twardowski and the Gestaltists. The most complete result of this tradition is undoubtedly the third of Husserl's Logical Investigations, called "the single most important contribution to realist (Aristotelian) ontology in the modern period". (shrink)

Euclidean diagrammatic reasoning refers to the diagrammatic inferential practice that originated in the geometrical proofs of Euclid’s Elements. A seminal philosophical analysis of this practice by Manders (‘The Euclidean diagram’, 2008) has revealed that a systematic method of reasoning underlies the use of diagrams in Euclid’s proofs, leading in turn to a logical analysis aiming to capture this method formally via proof systems. The central premise of this paper is that our understanding of Euclidean diagrammatic reasoning can be fruitfully advanced (...) by confronting these logical and philosophical analyses with the field of cognitive science. Surprisingly, central aspects of the philosophical and logical analyses resonate in very natural ways with research topics in mathematical cognition, spatial cognition and the psychology of reasoning. The paper develops these connections, concentrating on four issues: (1) the cognitive origins of Euclidean diagrammatic reasoning, (2) the cognitive representations of spatial relations in Euclidean diagrams, (3) the nature of the cognitive processes and cognitive representations involved in Euclidean diagrammatic reasoning seen as a form of visuospatial relational reasoning and (4) the complexity of Euclidean diagrammatic reasoning for the human cognitive system. For each of these issues, our analysis generates concrete experiment proposals, opening thereby the way for further empirical investigations. The paper is thus a prolegomenon to a research program on Euclidean diagrammatic reasoning at the crossroads of logic, philosophy and cognitive science. (shrink)

Through contact algebras we study theories of mereotopology in a uniform way that clearly separates mereological from topological concepts. We identify and axiomatize an important subclass of closure mereotopologies called unique closure mereotopologies whose models always have orthocomplemented contact algebras , an algebraic counterpart. The notion of MT-representability, a weak form of spatial representability but stronger than topological representability, suffices to prove that spatially representable complete OCAs are pseudocomplemented and satisfy the Stone identity. Within the resulting class of contact algebras (...) the strength of the algebraic complementation delineates two classes of mereotopology according to the key ontological choice between mereological and topological closure operations. All closure operations are defined mereologically if and only if the corresponding contact algebras are uniquely complemented while topological closure operations highly restrict the contact relation but allow not uniquely complemented and nondistributive contact algebras. Each class contains a single ontologically coherent theory that admits discrete models. (shrink)