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)

This paper examines several intended topological features of the Region Connection Calculus (RCC) and argues that they are either underdetermined by the formal theory or given by the complement axiom. Conditions are identified under which the axioms of RCC are satisfied in topological models under various set restrictions. The results generalise previous results in the literature to non-strict topological models and across possible interpretations of connection. It is shown that the intended interpretation of connection and (...) the alignment of self-connection with topological connection are underdetermined by the axioms of RCC, which suggests that additional axioms are necessary to secure these features. It is also argued that the complement axiom gives RCC models much of their topological structure. In particular, the incompatibility of RCC with interiors is argued to be given by the complement axiom. (shrink)

The Region Connection Calculus (RCC theory) is a well-known spatial representation of topological relations between regions. It claims that the connection relation is primitive in the spatial domain. We argue that the connection relation is indeed primitive to the spatial relations, although in RCC theory there is no room for distance relations. We first analyze some aspects of the RCC theory, e.g. the two axioms in the RCC theory are not strong enough to govern the (...) connection relation, regions in the RCC theory cannot be points, the uniqueness of the operation in the theory is not guaranteed, etc. To solve some of the problems, we propose an extension to the RCC theory by introducing the notion of region category and adding a new axiom which governs the characteristic property of the connection relation. The extended theory is named as RCC++. We support the claim that the connection relation is primitive to spatial domain by showing how distance relations, size relations are developed in RCC++. At last we revisit a sub-family of un-intended models in RCC theory, argue that RCC++ is more suitable than RCC with regards to its original intended model, and discuss the representation limitation of the RCC, as well as RCC++. (shrink)

The Region Connection Calculus (RCC theory) is a well-known spatial representation of topological relations between regions. It claims that the connection relation is primitive in the spatial domain. We argue that the connection relation is indeed primitive to the spatial relations, although in RCC theory there is no room for distance relations. We first analyze some aspects of the RCC theory, e.g. the two axioms in the RCC theory are not strong enough to govern the (...) connection relation, regions in the RCC theory cannot be points, the uniqueness of the $$\iota $$ operation in the theory is not guaranteed, etc. To solve some of the problems, we propose an extension to the RCC theory by introducing the notion of region category and adding a new axiom which governs the characteristic property of the connection relation. The extended theory is named as RCC++. We support the claim that the connection relation is primitive to spatial domain by showing how distance relations, size relations are developed in RCC++. At last we revisit a sub-family of un-intended models in RCC theory, argue that RCC++ is more suitable than RCC with regards to its original intended model, and discuss the representation limitation of the RCC, as well as RCC++. (shrink)

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)

This article discusses an approach to characterizing movement patterns (paths/trajectories) of individual agents that allows for relating aspects of cognitive conceptualization of movement patterns with formal spatial characterizations. To this end, we adopt a perspective of characterizing movement patterns on the basis of perceptual and conceptual invariants that we term movement choremes (MCs). MCs are formally grounded by behaviorally validating qualitative spatio-temporal calculi. Relating perceptual and cognitive aspects of space and formal theories of spatial information has shown promise to foster (...) understanding of the semantics of movement patterns. Specifically, we discuss our approach in relation to existing qualitative formalisms such as the region connection calculus and the Egenhofer’s intersection formalisms. We show that the MC approach is compatible with these approaches but offers additional opportunities to improve the cognitive adequacy of these formalisms. We summarize this paper using a movement taxonomy that also provides guidance for future research. (shrink)

In a recent paper, we have shown that the class of Boolean contact algebras (BCAs) has the hereditary property, the joint embedding property and the amalgamation property. By Fraïssé’s theorem, this shows that there is a unique countable homogeneous BCA. This paper investigates this algebra and the relation algebra generated by its contact relation. We first show that the algebra can be partitioned into four sets {0}, {1}, K, and L, which are the only orbits of the group of base (...) automorphisms of the algebra, and then show that the contact relation algebra of this algebra is finite, which is the first non-trivial extensional BCA we know which has this property. (shrink)

We present relational proof systems for the four groups of theories of spatial reasoning: contact relation algebras, Boolean algebras with a contact relation, lattice-based spatial theories, spatial theories based on a proximity relation.

Pak-China nexus has always been exemplary and phenomenal. Year 2015 is marked as the biggest milestone between these two all-weather friends. China Pakistan Economic Corridor is the key to the door that leads to the biggest ever trade activity that will be started from China and will be expanded to the middle-east, African and even some vibrant European markets. It is the biggest deal signed between Pakistan and any other country that promises the huge economic commotion. This corridor is basically (...) a part of new phase of globalization where the economic cooperation between countries and regions define the future of the respective economies. Due to its great economic and geo-strategic importance, CPEC has acquired global attention and analysts from all over the world are holding different opinions on this substantial economic corridor between China and Pakistan. This paper is a brief overview of the intra-regional connectivity that CPEC ensures and its impact on socioeconomic development of the entire region. This study evaluates the growth of energy sector, infrastructure development and advancements in connectivity in terms of transportation and communication as a result of this mega project. It also describes the inter-regional coordination within the country that will strengthen area-to-area bonding that is important for the uniform economic progress so far. Once the things start to move on smoothly and smartly, there is no ambiguity that this project will turn out as the socioeconomic revolution, mainly for Pakistan, then for China and obviously for the other countries of the region as well. (shrink)

Although Aristotle (Metaphysics, Book IV, Chapter 2) was perhaps the first person to consider the part-whole relationship to be a proper subject matter for philosophic inquiry, the Polish logician Stanislow Lesniewski [15] is generally given credit for the first formal treatment of the subject matter in his Mereology.1 Woodger [30] and Tarski [24] made use of a specific adaptation of Lesniewski's work as a basis for a formal theory of physical things and their parts. The term 'calculus of individuals' (...) was introduced by Leonard and Goodman [14] in their presentation of a system very similar to Tarski's adaptation of Lesniewski's Mereology. Contemporaneously with Lesniewski's development of his Mereology, Whitehead [27] and [28] was developing a theory of extensive abstraction based on the two-place predicate, 'x extends over y\ which is the converse of 'x is a part of y\ This system, according to Russell [22], was to have been the fourth volume of their Pήncipia Mathematica, the never-published volume on geometry. Both Lesniewski [15] and Tarski [25] have recognized the similarities between Whitehead's early work and Lesniewski's Mereology. Between the publication of Whitehead's early work and the publication of Process and Reality [29], Theodore de Laguna [7] published a suggestive alternative basis for Whitehead's theory. This led Whitehead, in Process and Reality, to publish a revised form of his theory based on the two-place predicate, 'x is extensionally connected with y\ It is the purpose of this paper to present a calculus of individuals based on this new Whiteheadian primitive predicate. (shrink)

Say that space is ‘gunky’ if every part of space has a proper part. Traditional theories of gunk, dating back to the work of Whitehead in the early part of last century, modeled space in the Boolean algebra of regular closed subsets of Euclidean space. More recently a complaint was brought against that tradition in Arntzenius and Russell : Lebesgue measure is not even finitely additive over the algebra, and there is no countably additive measure on the algebra. Arntzenius advocated (...) modeling gunk in measure algebras instead—in particular, in the algebra of Borel subsets of Euclidean space, modulo sets of Lebesgue measure zero. But while this algebra carries a natural, countably additive measure, it has some unattractive topological features. In this paper, we show how to construct a model of gunk that has both nice rudimentary measure-theoretic and topological properties. We then show that in modeling gunk in this way we can distinguish between finite dimensions, and that nothing in lost in terms of our ability to identify points as locations in space. (shrink)

Some formal properties of enriched systems of Lambek calculus with analogues of conjunction and disjunction are investigated. In particular, it is proved that the class of languages recognizable by the Lambek calculus with added intersective conjunction properly includes the class of finite intersections of context-free languages.

We present our calculus of higher-level rules, extended with propositional quantification within rules. This makes it possible to present general schemas for introduction and elimination rules for arbitrary propositional operators and to define what it means that introductions and eliminations are in harmony with each other. This definition does not presuppose any logical system, but is formulated in terms of rules themselves. We therefore speak of a foundational account of proof-theoretic harmony. With every set of introduction rules a canonical (...) elimination rule, and with every set of elimination rules a canonical introduction rule is associated in such a way that the canonical rule is in harmony with the set of rules it is associated with. An example given by Hazen and Pelletier is used to demonstrate that there are significant connectives, which are characterized by their elimination rules, and whose introduction rule is the canonical introduction rule associated with these elimination rules. Due to the availabiliy of higher-level rules and propositional quantification, the means of expression of the framework developed are sufficient to ensure that the construction of canonical elimination or introduction rules is always possible and does not lead out of this framework. (shrink)

This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language ℒ with a distinguished unary predicate c(x), function-symbols +, · and - and constants 0 and 1 is defined. An interpretation ℜ for ℒ is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as 'region x is connected' and the (...) function-symbols and constants are given their meaning in terms of a Boolean algebra of polygons. We give an alternative interpretation ������ base on the real closed plane which turns out to be isomorphic to ℜ. A set of axioms and a rule of inference are introduced. We prove the soundness and completeness of the calculus with respect to the given interpretation. (shrink)

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a (...) natural dual of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

Traditionally, “the operator calculus of Born and Wiener” has been considered one of the four formulations of quantum mechanics that existed in 1926. The present paper reviews the operator calculus as applied by Max Born and Norbert Wiener during the last months of 1925 and the early months of 1926 and its connections with the rise of the new quantum theory. Despite the relevance of this operator calculus, Born–Wiener’s joint contribution to the topic is generally bypassed in (...) historical accounts of quantum mechanics. In this study, we analyse the paper that epitomises the contribution, and we explain the main reasons for the apparent lack of interest in Born and Wiener’s work. We argue that they did not solve the main problem for which the tool was intended, that of linear motion, because of their reluctance to use Dirac delta functions. (shrink)

The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version (...) of the Lambek Calculus where we admit the empty sequence as the antecedent of a sequent is strongly complete w.r.t. those relational models whereW=U×U for some setU. We will also look into extendability of this completeness result to various fragments of Girard's Linear Logic as suggested in van Benthem (1991), p. 235, and investigate the connection between the Lambek Calculus and language models. (shrink)

A topological description of space is given, based on the relation of connection among regions and the property of being limited. A minimal set of 10 constraints is shown to permit definitions of points and of open and closed sets of points and to be characteristic of locally compact T2 spaces. The effect of adding further constraints is investigated, especially those that characterise continua. Finally, the properties of mappings in region-based topology are studied. Not all such mappings correspond (...) to point functions and those that do correspond to continuous functions. (shrink)