Parallelizing constraint programming with learning

DOI10.1007/978-3-319-33954-2_11MaRDI QIDQ2815101zbMATH OpenOpenAlexFDO

Authors Thorsten Ehlers, Peter J. Stuckey

Publication date 27 June 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_11

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• A review of literature on parallel constraint solving
• Transparent parallelization of constraint programming
• Lazy clause exchange policy for parallel SAT solvers
• Embarrassingly parallel search in constraint programming
• Lazy clause generation: combining the power of SAT and CP (and MIP?) solving

Cited in

(10)

• Transparent parallelization of constraint programming
• Embarrassingly parallel search in constraint programming
• Lazy clause exchange policy for parallel SAT solvers
• scientific article; zbMATH DE number 5141522 (Why is no real title available?)
• Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
• Rapid learning for binary programs
• A review of literature on parallel constraint solving
• Distributed domain propagation
• Learning Constraint Satisfaction Problems: An ILP Perspective
• Learning General Constraints in CSP

This page was built for publication: Parallelizing constraint programming with learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815101)