Spatial reasoning with RCC 8 and connectedness constraints in Euclidean spaces
From MaRDI portal
Publication:464617
DOI10.1016/J.ARTINT.2014.07.012zbMATH Open1408.68138OpenAlexW2162274427WikidataQ62048606 ScholiaQ62048606MaRDI QIDQ464617FDOQ464617
Authors: Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev 
Publication date: 27 October 2014
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.07.012
Recommendations
- Realizing RCC8 networks using convex regions
- A canonical model of the region connection calculus
- Topological logics with connectedness over Euclidean spaces
- Convex solutions of RCC8 networks
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Title not available (Why is that?)
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- Title not available (Why is that?)
- Qualitative spatial representation and reasoning: An overview
- Recognizing string graphs in NP
- Individuals and points
- A calculus of individuals based on 'connection'
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Constraint networks of topological relations and convexity
- Decidability of string graphs
- KI-95: Advances in artificial intelligence. 19th Annual German Conference on artificial intelligence, Bielefeld, Germany, September 11-13, 1995. Proceedings
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complemented disk algebra
Cited In (8)
- Topological logics with connectedness over Euclidean spaces
- Embedding RCC8D in the collective spatial logic CSLCS
- A canonical model of the region connection calculus
- RCC8 binary constraint network can be consistently extended
- Realizing RCC8 networks using convex regions
- Convex solutions of RCC8 networks
- Relational representation theorems for extended contact algebras
- A topological constraint language with component counting
This page was built for publication: Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464617)
