RCC8 binary constraint network can be consistently extended

DOI10.1016/J.ARTINT.2005.08.003MaRDI QIDQ2457645zbMATH OpenOpenAlexWikidataFDO

Authors Sanjiang Li, Huaiqing Wang

Publication date 23 October 2007

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2005.08.003

zbMATH Keywords

binary constraint networkcomputational complexityextensionalitypath-consistencyqualitative spatial reasoningregion connection calculus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1998332
• On topological consistency and realization
• Convex solutions of RCC8 networks
• Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus

Cites work

• A relation-algebraic approach to the region connection calculus
• A representation theorem for Boolean contact algebras
• Boolean connection algebras: A new approach to the Region-Connection Calculus
• Generalized region connection calculus
• scientific article; zbMATH DE number 4166929 (Why is no real title available?)
• scientific article; zbMATH DE number 1998332 (Why is no real title available?)
• Maintaining knowledge about temporal intervals
• On binary constraint problems
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Qualitative spatial reasoning with topological information
• Reasoning about temporal relations
• Region connection calculus: Its models and composition table

Cited in

(7)

• Algebraic foundations for qualitative calculi and networks
• GNet: a generalized network model and its applications in qualitative spatial reasoning
• Reasoning with topological and directional spatial information
• Reasoning about cardinal directions between extended objects: the NP-hardness result
• A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
• Qualitative constraint satisfaction problems: an extended framework with landmarks
• Reasoning about cardinal directions between extended objects

This page was built for publication: RCC8 binary constraint network can be consistently extended

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457645)