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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus. (1999)

by J Renz, B Nebel
Venue:Artificial Intelligence,
Add To MetaCart

Tools

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

Qualitative Spatial Representation and Reasoning: An Overview

by A G Cohn, S M Hazarika - FUNDAMENTA INFORMATICAE , 2001
"... The paper is a overview of the major qualitative spatial representation and reasoning techniques. We survey the main aspects of the representation of qualitative knowledge including ontological aspects, topology, distance, orientation and shape. We also consider qualitative spatial reasoning inclu ..."
Abstract - Cited by 264 (18 self) - Add to MetaCart
The paper is a overview of the major qualitative spatial representation and reasoning techniques. We survey the main aspects of the representation of qualitative knowledge including ontological aspects, topology, distance, orientation and shape. We also consider qualitative spatial reasoning including reasoning about spatial change. Finally there is a discussion of theoretical results and a glimpse of future work. The paper is a revised and condensed version of [33, 34].

Description Logics with Concrete Domains -- A Survey

by Carsten Lutz , 2003
"... ..."
Abstract - Cited by 182 (27 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...h there is no formula r1Rr2 in N , add the formula r1 sr r2, where sr (\spatially related") is the disjunction of all RCC-8 relations. Check the satisability of the set N and return the result. In =-=[34]-=-, it is proved that deciding the consistency of RCC-8 networks is an NPcomplete problem. Ecient methods for this task are described in [35]. It still needs to be shown that C is satisable if and onl...

A Temporal Description Logic for Reasoning about Actions and Plans

by Alessandro Artale, Enrico Franconi - Journal of Artificial Intelligence Research , 1998
"... A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The tempo ..."
Abstract - Cited by 98 (20 self) - Add to MetaCart
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered #rst: it is the composition of a temporal logic TL # able to express interval temporal networks # together with the non-temporal logic F # a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF . The former adds disjunction both at...
(Show Context)

Citation Context

...oth these steps involve NP-complete temporal constraint problems (van Beek & Cohen, 1990). However, it is possible to devise reasonable subsets of Allen's algebra for which the problem is polynomial (=-=Renz & Nebel, 1997-=-). The most relevant properties of a concept in CEF is that all the admissible interval temporal relations are explicit and the concept expression in each node is no more renable without changing the...

Qualitative Spatial Representation and Reasoning

by Anthony G Cohn, Jochen Renz - An Overview”, Fundamenta Informaticae , 2001
"... The need for spatial representations and spatial reasoning is ubiquitous in AI – from robot planning and navigation, to interpreting visual inputs, to understanding natural language – in all these cases the need to represent and reason about spatial aspects of the world is of key importance. Related ..."
Abstract - Cited by 71 (10 self) - Add to MetaCart
The need for spatial representations and spatial reasoning is ubiquitous in AI – from robot planning and navigation, to interpreting visual inputs, to understanding natural language – in all these cases the need to represent and reason about spatial aspects of the world is of key importance. Related fields of research, such as geographic information science
(Show Context)

Citation Context

...f the relations, but also the properties of the spatial entities that are being used. Bennett’s initial encodings were missing the regularity property of regions which was later added to the encoding =-=[173]-=-. The extended modal encoding was shown to be equivalent to the intended interpretation of the RCC-8 relations [150]. The intuitionistic and modal encodings were not only useful for providing a decida...

Spatial Reasoning with Topological Information

by Jochen Renz, Bernhard Nebel - Ph.D. thesis, Institut fur Informatik, Albert-Ludwigs-Universitat Freiburg , 1998
"... . This chapter summarizes our ongoing research on topological spatial reasoning using the Region Connection Calculus. We are addressing different questions and problems that arise when using this calculus. This includes representational issues, e.g., how can regions be represented and what is the re ..."
Abstract - Cited by 62 (2 self) - Add to MetaCart
. This chapter summarizes our ongoing research on topological spatial reasoning using the Region Connection Calculus. We are addressing different questions and problems that arise when using this calculus. This includes representational issues, e.g., how can regions be represented and what is the required dimension of the applied space. Further, it includes computational issues, e.g., how hard is it to reason with the calculus and are there efficient algorithms. Finally, we also address cognitive issues, i.e., is the calculus cognitively adequate. 1 Introduction When describing a spatial configuration or when reasoning about such a configuration, often it is not possible or desirable to obtain precise, quantitative data. In these cases, qualitative reasoning about spatial configurations may be used. Different aspects of space can be treated in a qualitative way. Among others there are approaches considering orientation, distance, shape, topology, and combinations of these. A summary o...
(Show Context)

Citation Context

...l prove that reasoning with RCC-8 is NP-hard in general and identify a large maximal tractable subset of RCC-8 which can be used to make reasoning much more efficient even in the general NP-hard case =-=[RN97]-=-. This chapter is organized as follows. In the second section we introduce RCC-8, Section 3 summarizes our empirical investigation on cognitive validity of RCC-8. In Section 4 we introduce the modal e...

EXPTIME tableaux for ALC

by Francesco M. Donini, Fabio Massacci - ARTIFICIAL INTELLIGENCE , 2000
"... The last years have seen two major advances in Knowledge Representation and Reasoning. First, many interesting problems (ranging from Semi-structured Data to Linguistics) were shown to be expressible in logics whose main deductive problems are EXPTIME-complete. Second, experiments in automated reaso ..."
Abstract - Cited by 61 (4 self) - Add to MetaCart
The last years have seen two major advances in Knowledge Representation and Reasoning. First, many interesting problems (ranging from Semi-structured Data to Linguistics) were shown to be expressible in logics whose main deductive problems are EXPTIME-complete. Second, experiments in automated reasoning have substantially broadened the meaning of “practical tractability”. Instances of realistic size for PSPACE-complete problems are now within reach for implemented systems. Still, there is a gap between the reasoning services needed by the expressive logics mentioned above and those provided by the current systems. Indeed, the algorithms based on tree-automata, which are used to prove EXPTIME-completeness, require exponential time and space even in simple cases. On the other hand, current algorithms based on tableau methods can take advantage of such cases, but require double exponential time in the worst case. We propose a tableau calculus for the description logic ALC for checking the satisfiability of a concept with respect to a TBox with general axioms, and transform it into the first simple tableaubased decision procedure working in single exponential time. To guarantee the ease of implementation, we also discuss the effects that optimizations (propositional backjumping, simplification, semantic branching, etc.) might have on our complexity result, and introduce a few optimizations ourselves.

Spatio-Temporal Predicates

by Martin Erwig, Markus Schneider - IEEE Transactions on Knowledge and Data Engineering , 1999
"... AbstractÐThis paper investigates temporal changes of topological relationships and thereby integrates two important research areas: First, two-dimensional topological relationships that have been investigated quite intensively and, second, the change of spatial information over time. We investigate ..."
Abstract - Cited by 57 (15 self) - Add to MetaCart
AbstractÐThis paper investigates temporal changes of topological relationships and thereby integrates two important research areas: First, two-dimensional topological relationships that have been investigated quite intensively and, second, the change of spatial information over time. We investigate spatio-temporal predicates, which describe developments of well-known spatial topological relationships. A framework is developed in which spatio-temporal predicates can be obtained by temporal aggregation of elementary spatial predicates and sequential composition. We compare our framework with two other possible approaches: one is based on the observation that spatio-temporal objects correspond to three-dimensional spatial objects for which existing topological predicates can be exploited. The other approach is to consider possible transitions between spatial configurations. These considerations help to identify a canonical set of spatio-temporal predicates. Index TermsÐTime in geographic information, spatio-temporal data types, representation of spatio-temporal objects, changes of spatial predicates, developments of spatial objects. 1
(Show Context)

Citation Context

...ime intervals and not on time points. Galton [25] has extended Allen's approach to the treatment of temporally changing topological relationships. Topological relationships are based on the RCC model =-=[10, 31]-=- which comes to similar results as Egenhofer's 9-intersection model. In contrast to Allen, Galton also takes time points into account, as we do. In specifying changes of spatial situations he uses the...

Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning

by Brandon Bennett, Anthony G. Cohn, Frank Wolter, Michael Zakharyaschev - APPLIED INTELLIGENCE , 2000
"... In this paper we advocate the use of multi-dimensional modal logics as a framework for knowledge representation and, in particular, for representing spatiotemporal information. We construct a two-dimensional logic capable of describing topological relationships that change over time. This logic, ca ..."
Abstract - Cited by 53 (6 self) - Add to MetaCart
In this paper we advocate the use of multi-dimensional modal logics as a framework for knowledge representation and, in particular, for representing spatiotemporal information. We construct a two-dimensional logic capable of describing topological relationships that change over time. This logic, called PSTL (Propositional Spatio-Temporal Logic) is the Cartesian product of the well-known temporal logic PTL and the modal logic S4u , which is the Lewis system S4 augmented with the universal modality. Although it is an open problem whether the full PSTL is decidable, we show that it contains decidable fragments into which various temporal extensions (both point-based and interval based) of the spatial logic RCC-8 can be embedded. We consider known decidability and complexity results that are relevant to computation with muli-dimensional formalisms and discuss possible directions for further research.

A Cognitive Assessment of Topological Spatial Relations: Results from an Empirical Investigation

by Markus Knauff , Reinhold Rauh, Jochen Renz - IN PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON SPATIAL INFORMATION THEORY (COSIT'97), VOLUME 1329 OF LECTURE NOTES IN COMPUTER SCIENCE , 1997
"... Whether or not a formal approach to spatial relations is a cognitively adequate (the term will be explicated in this paper) model of human spatial knowledge is more often based on the intuition of the researchers than on empirical data. In contrast, the research reported here is concerned with an ..."
Abstract - Cited by 52 (10 self) - Add to MetaCart
Whether or not a formal approach to spatial relations is a cognitively adequate (the term will be explicated in this paper) model of human spatial knowledge is more often based on the intuition of the researchers than on empirical data. In contrast, the research reported here is concerned with an empirical assessment of one of the three general classes of spatial relations, namely topological knowledge. In the reported empirical investigation, subjects had to group numerous spatial configurations consisting of two circles with respect to their similarity. As is well known, such tasks are solved on the basis of underlying spatial concepts. The results were compared with the RCC-theory and Egenhofer's approach to topological relations and support the assumption that both theories are cognitively adequate in a number of important aspects.
(Show Context)

Citation Context

...e done previously for Allen’s interval calculus (Knauff et al. 1995; Rauh, Schlieder & Knauff, 1997). An interesting question in this context is whether the computational properties of these calculi (=-=Renz & Nebel, 1997-=-) can be found again in the empirical investigations.Acknowledgments The reported research was supported by grants Str 301/5-1 (MeMoSpace) and Ne 623/ 1-1 (FAST-QUAL-SPACE) in the research program “S...

A Canonical Model of the Region Connection Calculus

by Jochen Renz - Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference (KR-98 , 1997
"... Canonical models are very useful for determining simple representation formalism for qualitative relations. Allen's interval relations, e.g., can thereby be represented using the start and the end point of the intervals. Such a simple representation was not possible for regions of higher dim ..."
Abstract - Cited by 51 (5 self) - Add to MetaCart
Canonical models are very useful for determining simple representation formalism for qualitative relations. Allen's interval relations, e.g., can thereby be represented using the start and the end point of the intervals. Such a simple representation was not possible for regions of higher dimension as used by the Region Connection Calculus. In this paper we present a canonical model which allows regions and relations between them to be represented as points of the topological space and information about their neighbourhoods. With this formalism we are able to prove that whenever a set of RCC-8 formulas is consistent there exists a realization in any dimension, even when the regions are constrained to be (sets of) polytopes. For three- and higher dimensional space this is also true for internally connected regions. Using the canonical model we give algorithms for generating consistent scenarios. 1 Introduction The Region Connection Calculus (RCC) is a topological approach t...
(Show Context)

Citation Context

...urposes is RCC-8, a sub-calculus of RCC that uses eight mutually exhaustive and pairwise disjoint 1 1 INTRODUCTION 2 base relations. The computational properties of RCC-8 have been studied thoroughly =-=[17, 19]-=- and efficient reasoning mechanisms were identified. Despite this, there are still some problems with representational aspects of RCC. As the calculus is based on topology, an obvious canonical model ...

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