Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
From MaRDI portal
Publication:464617
DOI10.1016/j.artint.2014.07.012zbMath1408.68138WikidataQ62048606 ScholiaQ62048606MaRDI QIDQ464617
Ian Pratt-Hartmann, Roman Kontchakov, Michael Zakharyashchev
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
complexity; connectedness; Euclidean space; satisfiability; qualitative spatial reasoning; spatial logic
68T27: Logic in artificial intelligence
Related Items
Cites Work
- On the complemented disk algebra
- Individuals and points
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- A calculus of individuals based on 'connection'
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- 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
- Reasoning about temporal relations
- Recognizing string graphs in NP
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item