Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
The slides for my talk on Feb. 27 2014 at ZIB.
Abstract:
Maximum Satisfiability (Max-SAT) and its weighted variants are optimization extension of Boolean Satisfiability (SAT), and it is interesting that technologies from both AI/CP community and OR community are employed to solve Max-SAT problems.
In this talk, I present brief introduction of SAT/Max-SAT problems, some of solving approaches, and my experience of submitting SCIP and my own SAT-based solver "toysat" to the Max-SAT Evaluation 2013; the annual Max-SAT solver competition. After that, I would like to have a discussion on submitting SCIP to the upcoming Max-SAT Evaluation 2014.
Login to see the comments