Learning cluster-based structure to solve constraint satisfaction problems

DOI10.1007/s10472-010-9212-zzbMath1226.68098MaRDI QIDQ647439

Susan L. Epstein, Xingjian Li

Publication date: 23 November 2011

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-010-9212-z

zbMATH Keywords

cluster; constraint satisfaction problem; structure learning; hybrid search

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Uses Software

• QUICKXPLAIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Variable neighborhood search for the maximum clique
• Identifying and exploiting problem structures using explanation-based constraint programming
• Tree clustering for constraint networks
• Radio link frequency assignment
• Decomposing constraint satisfaction problems using database techniques
• Compiling constraint satisfaction problems
• Planning in a hierarchy of abstraction spaces
• Tradeoffs in the Complexity of Backdoor Detection
• Typed Guarded Decompositions for Constraint Satisfaction
• Constraint Satisfaction with Bounded Treewidth Revisited
• A Sufficient Condition for Backtrack-Free Search
• Variable Neighborhood Search
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Principles and Practice of Constraint Programming – CP 2004