Computing and restoring global inverse consistency in interactive constraint satisfaction
From MaRDI portal
Publication:334804
DOI10.1016/j.artint.2016.09.001zbMath1392.68382OpenAlexW2519295952MaRDI QIDQ334804
Christophe Lecoutre, Christian Bessiere, Hélène Fargier
Publication date: 1 November 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.09.001
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimal constraint networks
- STR2: optimized simple tabular reduction for table constraints
- From local to global consistency
- Networks of constraints: Fundamental properties and applications to picture processing
- On forward checking for non-binary constraint satisfaction.
- STR3: a path-optimal filtering algorithm for table constraints
- Partition search for non-binary constraint satisfaction
- A sufficient condition for backtrack-bounded search
- Consistency restoration and explanations in dynamic CSPs---Application to configuration