On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces

@inproceedings{Kontchakov2011OnTD,
  title={On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces},
  author={Roman Kontchakov and Yavor Nenov and Ian Pratt-Hartmann and Michael Zakharyaschev},
  booktitle={IJCAI},
  year={2011}
}
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies dramatically depending on the dimension of the space and on the type of regions considered. For example, the logic with the interior-connectedness predicate (and without contact) is undecidable over polygons or regular closed sets in R2… 

Figures from this paper

Topological Logics with Connectedness over Euclidean Spaces
TLDR
The results show, in particular, that spatial reasoning is much harder over Euclidean spaces than over arbitrary topological spaces.
Computability of Euclidean spatial logics
TLDR
This work considers first-order and quantifier-free Euclidean spatial logics with primitives for topological relations and operations, the property of convexity and the ternary relation of being closer-than, and shows that the corresponding logics are undecidable.
Convex Solutions of RCC8 Networks
TLDR
It is shown that consistent RCC8 networks over 2n + 1 variables are guaranteed to have a convex solution in Euclidean spaces of n dimensions and higher, and it is proved that the bound is optimal for 2- and 3-dimensional spaces.
Reasoning about Topological and Cardinal Direction Relations Between 2-Dimensional Spatial Objects
TLDR
This paper combines some of the best known calculi in qualitative spatial reasoning, the RCC8 algebra for representing topological information, and the Rectangle Algebra and the Cardinal Direction Calculus for directional information to show that reasoning with topological and directional information is decidable and remains in NP.
Transition Constraints: A Study on the Computational Complexity of Qualitative Change
TLDR
This paper discusses the reasoning task of finding a solution to a temporal sequence of static reasoning problems where this sequence is subject to additional transition constraints, and shows how such transitions can be defined as relations and expressed within qualitative constraint formalisms.
Twenty Years of Topological Logic
Topological logics are formal systems for representing and manipulating information about the topological relationships between objects in space. Over the past two decades, these logics have been the
Drawing Interactive Euler Diagrams from Region Connection Calculus Specifications
TLDR
The improved local search and the hybrid method outperforms the local search from the literature and the gradient method for generating a diagram and both good results in terms of quality of drawings and stability are seen.
Probabilistic Region Connection Calculus
TLDR
A novel probabilistic model and specification language for spatial relations and a basic algorithm for answering queries about the probability of a relation to hold between two entities based on Markov Random Fields is shown.
RCC and the Theory of Simple Regions in ℝ2
TLDR
It is proved that, in dimension two and with the standard semantics, a theory equivalent to RCC can be given without any reference to points at the semantic level also.
...
1
2
...

References

SHOWING 1-10 OF 28 REFERENCES
Undecidability of Plane Polygonal Mereotopology
TLDR
It turns out that both the relations usually provided by mereotopolo-gies and more subtle topological relations are elementarily deenable in the model and Post's correspondence problem can be reduced to the decision problem of the model.
Spatial logics with connectedness predicates
TLDR
Computational complexity of quantifier-free spatial logics is investigated and it is shown that the connectedness constraints can increase complexity from NP to PSpace, ExpTime and, if component counting is allowed, to NExpTime.
Interpreting Topological Logics over Euclidean Spaces
TLDR
The crucial notion of tameness is identified, and the surprising patterns of sensitivity to the presence of non-tame regions exhibited by a range of topological logics in low-dimensional Euclidean spaces are charted.
Recognizing string graphs in NP
TLDR
It is shown that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the Recognition problem is NP-hard.
Spatial Reasoning in RCC-8 with Boolean Region Terms
TLDR
It is shown that the statisfiability problem for the extended language in arbitrary topological spaces is still in NP; however, it becomes PSPACE-complete if only the Euclidean spaces ℝn, n > 0, are regarded as possible interpretations.
A Pointless Theory of Space Based on Strong Connection and Congruence
We present a logical theory of space where only tridimensional regions are assumed in the domain. Three distinct primitives are used to describe their mereological, topological and morphological
A Canonical Model of the Region Connection Calculus
  • Jochen Renz
  • Computer Science
    J. Appl. Non Class. Logics
  • 2002
TLDR
A canonical model of R CC-8 is developed which allows a simple representation of regions with respect to a set of RCC-8 constraints, and enables us to generate realizations in any dimension d = 1.
Point-Set Topological Spatial Relations
Practical needs in the realm of Geographic Information Systems (GISs) have driven the efforts to investigate formal and sound methods to describe spatial relations. After an introduction of the basic
A Spatial Logic based on Regions and Connection
TLDR
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.
Spatial Reasoning with Propositional Logics
...
1
2
3
...