Automated within-problem learning for Constraint Satisfaction Problems

Abstract

Within-problem learning, and in particular learning from failure, has proven to be extremely beneficial in solving combinatorial problems in the boolean satisfiability domain (SAT) where both clause learning and clause weighting are used by many of the top SAT solvers. Similar research in solving constraint satisfaction problems (CSPs) has been done on… (More)

Topics

5 Figures and Tables