RCC8 binary constraint network can be consistently extended

DOI10.1016/j.artint.2005.08.003zbMath1131.68526WikidataQ62042765 ScholiaQ62042765MaRDI QIDQ2457645

Huaiqing Wang, Sanjiang Li

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

computational complexity; extensionality; region connection calculus; qualitative spatial reasoning; path-consistency; binary constraint network

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

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, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Region connection calculus: Its models and composition table
• Generalized region connection calculus
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Boolean connection algebras: A new approach to the Region-Connection Calculus
• Qualitative spatial reasoning with topological information
• A representation theorem for Boolean contact algebras
• On binary constraint problems
• Reasoning about temporal relations
• A relation-algebraic approach to the region connection calculus