Realizing RCC8 networks using convex regions
From MaRDI portal
Publication:2512988
Abstract: RCC8 is a popular fragment of the region connection calculus, in which qualitative spatial relations between regions, such as adjacency, overlap and parthood, can be expressed. While RCC8 is essentially dimensionless, most current applications are confined to reasoning about two-dimensional or three-dimensional physical space. In this paper, however, we are mainly interested in conceptual spaces, which typically are high-dimensional Euclidean spaces in which the meaning of natural language concepts can be represented using convex regions. The aim of this paper is to analyze how the restriction to convex regions constrains the realizability of networks of RCC8 relations. First, we identify all ways in which the set of RCC8 base relations can be restricted to guarantee that consistent networks can be convexly realized in respectively 1D, 2D, 3D, and 4D. Most surprisingly, we find that if the relation 'partially overlaps' is disallowed, all consistent atomic RCC8 networks can be convexly realized in 4D. If instead refinements of the relation 'part of' are disallowed, all consistent atomic RCC8 relations can be convexly realized in 3D. We furthermore show, among others, that any consistent RCC8 network with 2n+1 variables can be realized using convex regions in the n-dimensional Euclidean space.
Recommendations
Cites work
- A canonical model of the region connection calculus
- A Logic for Concepts and Similarity
- Boolean connection algebras: A new approach to the Region-Connection Calculus
- Complexity of some geometric and topological problems
- Constraint networks of topological relations and convexity
- Convex solutions of RCC8 networks
- Enriching taxonomies of place types using Flickr
- From frequency to meaning: vector space models of semantics
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 17662 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3572825 (Why is no real title available?)
- scientific article; zbMATH DE number 2068110 (Why is no real title available?)
- Interpolative and extrapolative reasoning in propositional theories using qualitative knowledge about conceptual spaces
- Maintaining knowledge about temporal intervals
- On the combinatorial and algebraic complexity of quantifier elimination
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- On topological consistency and realization
- Polynomial Root Dragging
- Polynomial root motion
- Solving conflicts in information merging by a flexible interpretation of atomic propositions
- Spatial reasoning in a fuzzy region connection calculus
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Cited in
(7)- Constraint networks of topological relations and convexity
- Spatial reasoning about points in a multidimensional setting
- Convex solutions of RCC8 networks
- A canonical model of the region connection calculus
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- On topological consistency and realization
This page was built for publication: Realizing RCC8 networks using convex regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512988)
