Inference in MaxSAT and MinSAT.
Chu Min LiFelip ManyàPublished in: The Logic of Software. A Tasting Menu of Formal Methods (2022)
Keyphrases
- unsatisfiable cores
- branch and bound algorithm
- boolean satisfiability
- combinatorial optimization problems
- sat problem
- sat solvers
- combinatorial optimization
- maximum satisfiability
- max sat
- lower bound
- upper bound
- randomly generated
- combinatorial auctions
- branch and bound
- search tree
- propositional satisfiability
- hidden structure
- np hard
- np complete
- sat instances
- knapsack problem
- optimization problems
- probabilistic planning
- optimal solution