Spatial reasoning with RCC 8 and connectedness constraints in Euclidean spaces

DOI10.1016/J.ARTINT.2014.07.012MaRDI QIDQ464617zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

complexitysatisfiabilityconnectednessEuclidean spacequalitative spatial reasoningspatial logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 42239 (Why is no real title available?)
• scientific article; zbMATH DE number 53332 (Why is no real title available?)
• scientific article; zbMATH DE number 1998332 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• A calculus of individuals based on 'connection'
• Constraint networks of topological relations and convexity
• Decidability of string graphs
• Individuals and points
• KI-95: Advances in artificial intelligence. 19th Annual German Conference on artificial intelligence, Bielefeld, Germany, September 11-13, 1995. Proceedings
• On the complemented disk algebra
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Qualitative spatial representation and reasoning: An overview
• Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
• Recognizing string graphs in NP
• String graphs requiring exponential representations
• String graphs. II: Recognizing string graphs is NP-hard

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)