Efficient Methods for Qualitative Spatial Reasoning

@article{Renz2001EfficientMF,
  title={Efficient Methods for Qualitative Spatial Reasoning},
  author={Jochen Renz and Bernhard Nebel},
  journal={ArXiv},
  year={2001},
  volume={abs/1106.0679}
}
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… 

Figures from this paper

Methods for Qualitative Spatial Reasoning

The 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 R CC-8 that have been identi ed by us.

Efficient Dynamic Methods for Qualitative Constraint-based Spatial and Temporal Reasoning (Position Paper)

A research roadmap for going beyond the state of the art in Qualitative Spatial and Temporal Reasoning is described, and dynamic algorithms pertaining to these consistencies that can allow for efficient reasoning over streams of spatio-temporal information are defined.

Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning

This work describes how to make use of the path-consistency method, which can be applied to a wide range of different aspects of spatial reasoning, and points out the possible problems one might encounter.

Qualitative Spatial and Temporal Reasoning: Efficient Algorithms for Everyone

This paper extends the refinement algorithm and presents a procedure which identifies large tractable subsets of spatial and temporal calculi automatically without any manual intervention and without the need for additional NP-hardness proofs.

Just-In-Time Constraint-Based Inference for Qualitative Spatial and Temporal Reasoning

A research roadmap for going beyond the state of the art in qualitative spatial and temporal reasoning (QSTR) via defining tools for tackling dynamic variants of the fundamental reasoning problems in this discipline, i.e., problems stated in terms of changing input data.

Just-In-Time Constraint-Based Inference for Qualitative Spatial and Temporal Reasoning

A research roadmap for going beyond the state of the art in qualitative spatial and temporal reasoning (QSTR) via defining tools for tackling dynamic variants of the fundamental reasoning problems in this discipline, i.e., problems stated in terms of changing input data.

Combining representations of topology and distance

A unified model for qualitative topology and distance information is proposed, and a path-consistency algorithm is put forward to deal with the constraint satisfaction problem, and then its time complex is discussed.

Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments

We study the translation of reasoning problems involving qualitative spatio-temporal calculi into answer set programming (ASP). We present various alternative transformations and provide a

Reasoning about vague topological information

This paper shows how many interesting reasoning tasks, such as consistency checking and entailment checking, can be supported in a generalization of the well-known RCC-8 calculus, and presents decision procedures based on linear programming, solving all reasoning tasks of interest.
...

References

SHOWING 1-10 OF 33 REFERENCES

On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus

Computational Properties of Qualitative Spatial Reasoning: First Results

This paper focuses on the so-called RCC approach and uses Bennett's encoding of spatial reasoning in intuitionistic logic in order to show that consistency checking for the topological base relations can be done efficiently and proves path-consistency is sufficient for deciding global consistency.

Qualitative Spatial Reasoning with Topological Information

  • Jochen Renz
  • Medicine
    Lecture Notes in Computer Science
  • 2002
This work Enumeration of the Relations of the Maximal Tractable Subsets of RCC-8 and Empirical Evaluation of Reasoning with R CC-8 shows positive results in terms of tractability and representation.

Logical representations for automated reasoning about spatial relationships

It is proved that entailment, which is valid according to the standard semantics for these logics, is also valid with respect to the spatial interpretation and well-known mechanisms for propositional reasoning can be applied to spatial reasoning.

Spatial Reasoning with Propositional Logics

A Spatial Logic based on Regions and Connection

An interval logic for reasoning about space is described, which supports a simpler ontology, has fewer functions and relations, yet does not su er in terms of its useful expressiveness.

The Design and Experimental Analysis of Algorithms for Temporal Reasoning

This paper discusses the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information, and develops techniques that can result in up to a ten-fold speedup over an already highly optimized implementation.

Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis

A general method for proving tractability of reasoning over disjunctions of jointly exhaustive and pairwise disjoint relations of Allen's temporal interval relations and their spatial counterpart, the R.CC8 relations by Randell, Cui, and Colin is presented.

Complexity and algorithms for reasoning about time: a graph-theoretic approach

This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics and shows that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete.

Topological Inference

The computational problems involved in developing a relational consistency and planarity inference system are studied, and polynomial-time algorithms for several important special cases are developed and proved to be NP-hard.