Josep Argelich,



Max-SAT is the optimization version of the well know Satisfiability Problem. In this talk we will introduce the Max-SAT problem and the solving techniques used by the most successful state-of-the-art Max-SAT solvers as, for example, the Branch and Bound schema, techniques for improving the lower bound using underestimation and inference, and variable selection heuristics. Next, we will introduce Weighted and Partial Max-SAT and we will see new techniques for these formalisms and adaptations from the techniques used in Max-SAT. Finally, we will present and discuss some results of the last Max-SAT evaluation.


Date: 2008-Oct-21     Time: 14:30:00     Room: 04

For more information:

  • 213100290