Solving Techniques and Heuristics for Max-SAT and Partial Max-SAT
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:
INESC-ID ESR Talks – February 2023
If you are a masters/PhD student or a postdoctoral fellow, come and present your work in an informal and friendly environment – and savour some tasty snacks!
Individual talks will be 10-15 minutes plus time for feedback. Enroll on your selected date by emailing pedro.ferreira[at]inesc-id.pt.
Happening on the second Wednesday of every month (4pm-5pm):
- 15 February (Alves Redol, Room 9)
- 15 March (Alves Redol, Room 9)
- 12 April (Alves Redol, Room 9)
- 10 May (Alves Redol, Room 9)
- 14 June (Alves Redol, Room 9)
- 12 July (Alves Redol, Room 9)
We hope to see you there!