BIRS Workshop Lecture Videos
Pseudo-Boolean Optimization Le Berre, Daniel
Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfaction problems. Because of the very efficient SAT solvers available, many of those optimization problems can be solved by reusing those solvers as black boxes. In this talk, we will provide some insights about the reason of the success of the black box approaches, some of their limitations, and raise open problems to design more efficient Boolean optimizers.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International