Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.
Vasco M. ManquinhoJoão P. Marques SilvaPublished in: SAT (2004)
Keyphrases
- pseudo boolean optimization
- lower bound
- upper bound
- branch and bound algorithm
- sufficiently accurate
- branch and bound
- lower bounding
- constraint satisfaction problems
- optimal solution
- lower and upper bounds
- answer set programming
- worst case
- np hard
- boolean satisfiability
- objective function
- sat solvers
- ai planning
- online learning
- logic programs
- confidence intervals
- sample complexity
- constraint solver
- bounded model checking