Typed Guarded Decompositions for Constraint Satisfaction
From MaRDI portal
Publication:3524238
DOI10.1007/11889205_11zbMath1160.68541OpenAlexW1563762387MaRDI QIDQ3524238
Martin J. Green, David A. Cohen
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11889205_11
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Structural decompositions for problems with global constraints ⋮ Learning cluster-based structure to solve constraint satisfaction problems ⋮ Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
This page was built for publication: Typed Guarded Decompositions for Constraint Satisfaction
