A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems

DOI10.1016/J.TCS.2012.04.004MaRDI QIDQ441879zbMATH OpenOpenAlexFDO

Authors Khalil Challita

Publication date 8 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.04.004

zbMATH Keywords

consistencyconstraint satisfaction problemsqualitative spatial reasoningregion connection calculus

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1745031
• On the expressiveness of spatial constraint systems
• Solving quantified constraint satisfaction problems
• Qualitative constraint satisfaction problems: an extended framework with landmarks

Cites work

• scientific article; zbMATH DE number 1149443 (Why is no real title available?)
• A calculus of individuals based on 'connection'
• A representation theorem for minmax regret policies
• Composing cardinal direction relations
• Computability and Logic
• Individuals and points
• Introduction to algorithms
• Maintaining knowledge about temporal intervals
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• On topological consistency and realization
• RCC8 binary constraint network can be consistently extended
• Reasoning about temporal relations

Cited in

(1)

• Convex solutions of RCC8 networks

This page was built for publication: A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems

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