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

DOI10.1016/J.TCS.2012.04.004zbMATH Open1280.68246OpenAlexW1995543121MaRDI QIDQ441879FDOQ441879

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

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

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)

Cites Work

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

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)