Learning Hard Constraints in Max-SAT ⋆

@inproceedings{Argelich2006LearningHC,
  title={Learning Hard Constraints in Max-SAT ⋆},
  author={Josep Argelich and Felip Many{\`a}},
  year={2006}
}
Solving over-constrained problems with Max-SAT solvers typically consists of finding an assignment that satisfies all the hard constraints and the maximum number of soft constraints. Despite the relevance of clause learning in SAT for solving structured instances, this technology has not yet been extended to Max-SAT. In this paper, we have incorporated a module that learns hard clauses in a branch and bound Max-SAT solver, and performed an empirical investigation that provides evidence that… CONTINUE READING

Similar Papers

Loading similar papers…