• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Qualitative spatial reasoning with topological information. Lecture notes in computer science Lecture notes in artificial intelligence: Vol. 2293 (2002)

by J Renz
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 59
Next 10 →

Spatio-temporal representation and reasoning based on RCC-8

by Frank Wolter, Michael Zakharyaschev - In Proceedings of the seventh Conference on Principles of Knowledge Representation and Reasoning, KR2000 , 2000
"... this paper is to introduce a hierarchy of languages intended for qualitative spatio-temporal representation and reasoning, provide these languages with topological temporal semantics, construct effective reasoning algorithms, and estimate their computational complexity. ..."
Abstract - Cited by 60 (10 self) - Add to MetaCart
this paper is to introduce a hierarchy of languages intended for qualitative spatio-temporal representation and reasoning, provide these languages with topological temporal semantics, construct effective reasoning algorithms, and estimate their computational complexity.
(Show Context)

Citation Context

...nt RCC-8 of RCC containing eight jointly exhaustive and pairwise disjoint base relations between spatial regions. This fragment has attracted considerable attention of the spatial reasoning community =-=[2, 3, 19, 27, 28, 29]-=-. First, it is sufficiently expressive for various application purposes, say in GIS. And second, RCC-8 has nice computational properties: it turns out to be decidable [2], in fact NP-complete [29]. Ac...

Efficient methods for qualitative spatial reasoning

by Jochen Renz, Bernhard Nebel - Proceedings of the 13th European Conference on Artificial Intelligence , 1998
"... The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the adaption of the algorithms used for qualitative temporal reasoning can solve large RCC-8 instances, ..."
Abstract - Cited by 52 (12 self) - Add to MetaCart
The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the adaption of the algorithms used for qualitative temporal reasoning can solve large RCC-8 instances, even if they are in the phase transition region -- provided that one uses the maximal tractable subsets of RCC-8 that have been identified by us. In particular, we demonstrate that the orthogonal combination of heuristic methods is successful in solving almost all apparently hard instances in the phase transition region up to a certain size in reasonable time.

Combining Spatial and Temporal Logics: Expressiveness Vs. Complexity

by David Gabelaia, Roman Kontchakov, Agi Kurucz, Frank Wolter, Michael Zakharyaschev - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 2004
"... In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic the spatial logics RCC-8, BRCC-8, S4 u and their fragments. The obtained results give ..."
Abstract - Cited by 25 (9 self) - Add to MetaCart
In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic the spatial logics RCC-8, BRCC-8, S4 u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and `computational realisability' within the hierarchy. We demonstrate how di#erent combining principles as well as spatial and temporal primitives can produce NP-, PSPACE-, EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out of components that are at most NP- or PSPACE-complete.
(Show Context)

Citation Context

...PT L×S4u, PT L◦S4u and PT L✷ ×S4u solves a major open problem of Wolter and Zakharyaschev (2002). It shows that, while S4u is a suitable candidate for efficient pure spatial reasoning (Bennett, 1996; =-=Renz & Nebel, 1998-=-; Aiello & van Benthem, 2002a), its temporal extensions satisfying both (PC) and (OC) are not suitable for practical spatio-temporal representation and reasoning. 2. Logics like PT L × BRCC-8 may turn...

A topological constraint language with component counting

by Ian Pratt-hartmann - Journal of Applied Non-Classical Logics
"... ABSTRACT. 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 typicall ..."
Abstract - Cited by 12 (4 self) - Add to MetaCart
ABSTRACT. 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 touches the boundary of region ”, “region is connected ” or “region is a proper part of the closure of region ”. A formula 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, a rough acronym for “topological constraint language with component counting”. (Thus, extends earlier topological constraint languages based on the so-called RCC-primitives.) Our main result is that the problem of determining the satisfiability of a-formula is NEXPTIME-complete.

Data Models and Query Languages for Linked Geospatial Data, in: Reasoning Web. Semantic Technologies for Advanced Query Answering

by Manolis Koubarakis, Manos Karpathiotakis, Kostis Kyzirakos, Charalampos Nikolaou, Michael Sioutis , 2012
"... Abstract. The recent availability of geospatial information as linked open data has generated new interest in geospatial query processing and reasoning, a topic with a long tradition of research in the areas of databases and artificial intelligence. In this paper we survey recent ad-vances in this i ..."
Abstract - Cited by 11 (9 self) - Add to MetaCart
Abstract. The recent availability of geospatial information as linked open data has generated new interest in geospatial query processing and reasoning, a topic with a long tradition of research in the areas of databases and artificial intelligence. In this paper we survey recent ad-vances in this important research topic, concentrating on issues of data modeling and querying. 1
(Show Context)

Citation Context

...re encoded using the Rectangle Algebra [9]. However, since the relationships of the Rectangle Algebra are too fine-grained, the more intuitive relatioships of the Rectangular Cardinal Relations model =-=[62]-=- and the Region Connection Calculus [61]areusedinSXPath. [55] also presents theoretical and implementation results concerning a subset of SXPath that appears to capture the most useful queries. Finall...

SXPath: extending XPath towards spatial querying on web documents

by Ermelinda Oro, Massimo Ruffolo, Steffen Staab, Universität Koblenz-landau, Ermelinda Oro, Massimo Ruffolo, Via P. Bucci, Steffen Staab - Proc. VLDB Endow , 2010
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
(Show Context)

Citation Context

...r information extraction purposes. Therefore, we propose to extend XPath 1.0 by new spatial navigation primitives that allow for querying Web documents, namely: (i) Spatial Axes, based on topological =-=[21]-=- and rectangular cardinal relations [18], that allow for selecting document nodes that have a specific spatial relation w.r.t. the context node. (ii) Spatial Position Functions that exploit some spati...

The Egenhofer–Cohn Hypothesis or, Topological Relativity?

by Rui Li, Jinlong Yang, Frank Hardisty, Sen Xu, R. Li, J. Yang, F. Hardisty, S. Xu
"... Abstract In this chapter, we provide an overview of research on cognitively validating qualitative calculi, focusing on the region connection calculus (RCC) and Egenhofer’s intersection models (IM). These topological theories are often claimed to be foundational to spatial cognition, a concept we te ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Abstract In this chapter, we provide an overview of research on cognitively validating qualitative calculi, focusing on the region connection calculus (RCC) and Egenhofer’s intersection models (IM). These topological theories are often claimed to be foundational to spatial cognition, a concept we term the Egenhofer– Cohn Hypothesis. (The authors are aware of the limitations of the chosen title/ term. Neither Egenhofer nor Cohn necessarily support this claim in a strong form but they kindly agreed to have their names used here. Additionally, there are other approaches to topology, Cohn is the third author on the classic RCC paper, and Egenhofer published his work with co-authors. However, we feel that these two names best summarize the two most prominent topological theories in the spatial sciences.) We have been particularly interested in extending existing approaches into the realm of spatio-temporal representation and reasoning. We provide an overview on a series of experiments that we conducted to shed light on geographic event conceptualization and topology’s role in modeling and explaining cognitive

Spatial Information Theory Meets Spatial Thinking -- Is Topology the Rosetta Stone of Spatial Cognition?

by Alexander Klippel - ACCEPTED BY: ANNALS OF THE ASSOCIATION OF AMERICAN GEOGRAPHERS
"... Topology is the most commonly used spatial construct to bridge the gap between formal spatial information theory and systems on the one side and (human) spatial cognition and thinking on the other. To this end, we find topological calculi in virtually all research areas pertinent to spatial informat ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Topology is the most commonly used spatial construct to bridge the gap between formal spatial information theory and systems on the one side and (human) spatial cognition and thinking on the other. To this end, we find topological calculi in virtually all research areas pertinent to spatial information science such as ontological modeling, geographic information retrieval, image analysis and classification. Manifold experiments have been conducted to assess the cognitive adequacy of topological calculi with varying results. Our contribution here is unique for two reasons: on the one hand, we are addressing, behaviorally, the role of topology in the crucial area of spatio-temporal information; on the other hand, we are evaluating the role of topology across different semantic domains. We report five experiments that were conducted in the framework we developed (Klippel and Li 2009), which combine critical constructs from spatial information theory and cognitive science. Topologically equivalent movement patterns were specified across five domains using paths through a conceptual neighborhood graph. This approach allows us to disentangle the role of topology from the influence of semantic context. The results show that topology plays an important yet not semantic-independent role in characterizing the cognitive conceptualization of geographic events.

Symbol Recognition using Spatial Relations

by Santosh K. C. , Bart Lamiroy , Laurent Wendling , 2012
"... In this paper, we present a method for symbol recognition based on the spatio–structural description of a ‘vocabulary’ of extracted visual elementary parts. It is applied to symbols in electrical wiring diagrams. The method consists of first identifying vocabulary elements into different groups base ..."
Abstract - Cited by 6 (6 self) - Add to MetaCart
In this paper, we present a method for symbol recognition based on the spatio–structural description of a ‘vocabulary’ of extracted visual elementary parts. It is applied to symbols in electrical wiring diagrams. The method consists of first identifying vocabulary elements into different groups based on their types (e.g., circle, corner). We then compute spatial relations between the possible pairs of labelled vocabulary types which are further used as a basis for building an Attributed Relational Graph that fully describes the symbol. These spatial relations integrate both topology and directional information. The experiments reported in this paper show that this approach, used for recognition, significantly outperforms both structural and signal–based state–of–the–art methods.
(Show Context)

Citation Context

... a unique reference set R, defined by the topology of the minimum bounding rectangles (MBR) of A and B and with the help of the 9-intersection model [Egenhofer and Herring, 1991]. In connection with [=-=Renz and Nebel, 1998-=-], R is either the common portion of two neighbouring sides in the case of disconnected MBRs or the intersection in the case of overlapping, equal or otherwise connected MBRs. To do this, we simply ch...

Card Sorting for Cartographic Research and Practice

by Robert E. Roth, Benjamin G. Finch, Justine I. Blanford, Anthony C. Robinson, Alan M. Maceachren - Cart. & Geog.Inf.Science , 2011
"... In this article, we describe the potential utility of the card sorting method for structuring and refining large map symbol sets. Simply defined, card sorting requires that participants organize a set of items (i.e., cards) into categories according to some characteristic(s) of the cards (i.e., the ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
In this article, we describe the potential utility of the card sorting method for structuring and refining large map symbol sets. Simply defined, card sorting requires that participants organize a set of items (i.e., cards) into categories according to some characteristic(s) of the cards (i.e., the sorting criterion). Card sorting has been proposed as a method for delineating categories by researchers and practitioners in a variety of disciplines due to its ability to identify and explicate real or perceived structures in an information space; despite this, there is little reported application of card sorting within Cartography. To facilitate application of card sorting to cartographic problems, we offer a framework that prescribes the appropriate experimental design settings for the method based on the stage in the design process and the goals of the study. We then demonstrate the utility of card sorting for Cartography by describing a closed sorting study we conducted on the ANSI INCITS 415-2006 emergency mapping symbol standard. Our approach helped us identify several barriers to using the symbol standard, including areas of conceptual overlap among the categories included in the standard, potentially missing categories from the standard, and individual symbols in the standard that are consistently misclassified. 1.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University