scholarly journals Qualitative Spatial Reasoning with Directional and Topological Relations

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Sangha Nam ◽  
Incheol Kim

A wide range of application domains from cognitive robotics to intelligent systems encompassing diverse paradigms such as ambient intelligence and ubiquitous computing environments require the ability to represent and reason about the spatial aspects of the environment within which an agent or a system is functional. Many existing spatial reasoners share a common limitation that they do not provide any checking functions for cross-consistency between the directional and the topological relation set. They provide only the checking function for path-consistency within a directional or topological relation set. This paper presents an efficient spatial reasoning algorithm working on a mixture of directional and topological relations between spatial entities and then explains the implementation of a spatial reasoner based on the proposed algorithm. Our algorithm not only has the checking function for path-consistency within each directional or topological relation set, but also provides the checking function for cross-consistency between them. This paper also presents an application system developed to demonstrate the applicability of the spatial reasoner and then introduces the results of the experiment carried out to evaluate the performance of our spatial reasoner.

Author(s):  
Matthew P. Dube

Topological relations and direction relations represent two pieces of the qualitative spatial reasoning triumvirate. Researchers have previously attempted to use the direction relation matrix to derive a topological relation, finding that no single direction relation matrix can isolate a particular topological relation. In this paper, the technique of topological augmentation is applied to the same problem, identifying a unique topological relation in 28.6% of all topologically augmented direction relation matrices, and furthermore achieving a reduction in a further 40.4% of topologically augmented direction relation matrices when compared to their vanilla direction relation matrix counterpart.


2016 ◽  
Vol 20 (3) ◽  
pp. 473-493 ◽  
Author(s):  
PETER INDEFREY ◽  
HÜLYA ŞAHIN ◽  
MARIANNE GULLBERG

We investigated how two groups of Turkish–Dutch bilinguals and two groups of monolingual speakers of the two languages described static topological relations. The bilingual groups differed with respect to their first (L1) and second (L2) language proficiencies and a number of sociolinguistic factors. Using an elicitation tool that covers a wide range of topological relations, we first assessed the extensions of different spatial expressions (topological relation markers, TRMs) in the Turkish and Dutch spoken by monolingual speakers. We then assessed differences in the use of TRMs between the two bilingual groups and monolingual speakers.In both bilingual groups, differences compared to monolingual speakers were mainly observed for Turkish. Dutch-dominant bilinguals showed enhanced congruence between translation-equivalent Turkish and Dutch TRMs. Turkish-dominant bilinguals extended the use of a topologically neutral locative marker.Our results can be interpreted as showing different “bilingual optimization strategies” (Muysken, 2013) in bilingual speakers who live in the same environment but differ with respect to L2 onset, L2 proficiency, and perceived importance of the L1.


Author(s):  
E. Mohammadi ◽  
A. J. S. Hunter

We propose that participatory GIS (PGIS) activities including participatory urban planning can be made more efficient and effective if spatial reasoning rules are integrated with PGIS tools to simplify engagement for public contributors. Spatial reasoning is used to describe relationships between spatial entities. These relationships can be evaluated quantitatively or qualitatively using geometrical algorithms, ontological relations, and topological methods. Semantic web services utilize tools and methods that can facilitate spatial reasoning. GeoSPARQL, introduced by OGC, is a spatial reasoning standard used to make declarations about entities (graphical contributions) that take the form of a subject-predicate-object triple or statement. GeoSPARQL uses three basic methods to infer topological relationships between spatial entities, including: OGC's simple feature topology, RCC8, and the DE-9IM model. While these methods are comprehensive in their ability to define topological relationships between spatial entities, they are often inadequate for defining complex relationships that exist in the spatial realm. Particularly relationships between urban entities, such as those between a bus route, the collection of associated bus stops and their overall surroundings as an urban planning pattern. In this paper we investigate common qualitative spatial reasoning methods as a preliminary step to enhancing the capabilities of GeoSPARQL in an online participatory GIS framework in which reasoning is used to validate plans based on standard patterns that can be found in an efficient/effective urban environment.


Author(s):  
Ahed Alboody ◽  
Florence Sedes ◽  
Jordi Inglada

In this context, the authors develop definitions for the generalization of these detailed topological relations at these two levels (Level-1 and Level-2). The chapter presents two tables of these four detailed relations. Finally, examples for GIS applications are provided to illustrate the determination of the detailed topological relations studied in this chapter.


2016 ◽  
Vol 17 (2) ◽  
pp. 205-225 ◽  
Author(s):  
PRZEMYSŁAW ANDRZEJ WAŁĘGA ◽  
CARL SCHULTZ ◽  
MEHUL BHATT

AbstractThe systematic modelling ofdynamic spatial systemsis a key requirement in a wide range of application areas such as commonsense cognitive robotics, computer-aided architecture design, and dynamic geographic information systems. We present Answer Set Programming Modulo Theories (ASPMT)(QS), a novel approach and fully implemented prototype for non-monotonic spatial reasoning — a crucial requirement within dynamic spatial systems — based on ASPMT. ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Satisfiability Modulo Theories (SMT) instances in order to compute stable models by means of SMT solvers. We formalise and implement concepts of default spatial reasoning and spatial frame axioms. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real non-linear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other contemporary spatial reasoning systems both within and outside the context of logic programming. ASPMT(QS) is currently the only existing system that is capable of reasoning about indirect spatial effects (i.e., addressing the ramification problem), and integrating geometric and QS information within a non-monotonic spatial reasoning context.


2021 ◽  
Vol 5 (1) ◽  
pp. 1-20
Author(s):  
Isabelle Bloch

Abstract In many domains of information processing, such as knowledge representation, preference modeling, argumentation, multi-criteria decision analysis, spatial reasoning, both vagueness, or imprecision, and bipolarity, encompassing positive and negative parts of information, are core features of the information to be modeled and processed. This led to the development of the concept of bipolar fuzzy sets, and of associated models and tools, such as fusion and aggregation, similarity and distances, mathematical morphology. Here we propose to extend these tools by defining algebraic and topological relations between bipolar fuzzy sets, including intersection, inclusion, adjacency and RCC relations widely used in mereotopology, based on bipolar connectives (in a logical sense) and on mathematical morphology operators. These definitions are shown to have the desired properties and to be consistent with existing definitions on sets and fuzzy sets, while providing an additional bipolar feature. The proposed relations can be used for instance for preference modeling or spatial reasoning. They apply more generally to any type of functions taking values in a poset or a complete lattice, such as L-fuzzy sets.


1991 ◽  
Vol 15 (3-4) ◽  
pp. 357-379
Author(s):  
Tien Huynh ◽  
Leo Joskowicz ◽  
Catherine Lassez ◽  
Jean-Louis Lassez

We address the problem of building intelligent systems to reason about linear arithmetic constraints. We develop, along the lines of Logic Programming, a unifying framework based on the concept of Parametric Queries and a quasi-dual generalization of the classical Linear Programming optimization problem. Variable (quantifier) elimination is the key underlying operation which provides an oracle to answer all queries and plays a role similar to Resolution in Logic Programming. We discuss three methods for variable elimination, compare their feasibility, and establish their applicability. We then address practical issues of solvability and canonical representation, as well as dynamical updates and feedback. In particular, we show how the quasi-dual formulation can be used to achieve the discriminating characteristics of the classical Fourier algorithm regarding solvability, detection of implicit equalities and, in case of unsolvability, the detection of minimal unsolvable subsets. We illustrate the relevance of our approach with examples from the domain of spatial reasoning and demonstrate its viability with empirical results from two practical applications: computation of canonical forms and convex hull construction.


Sign in / Sign up

Export Citation Format

Share Document