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

DOI10.1016/j.tcs.2012.04.004zbMath1280.68246OpenAlexW1995543121MaRDI QIDQ441879

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

consistencyregion connection calculusconstraint satisfaction problemsqualitative spatial reasoning

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Composing cardinal direction relations
• On topological consistency and realization
• A representation theorem for minmax regret policies
• Individuals and points
• A calculus of individuals based on 'connection'
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• RCC8 binary constraint network can be consistently extended
• Computability and Logic
• Reasoning about temporal relations

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