Clausal Forms in MaxSAT and MinSAT.
Chu Min LiFelip ManyàJoan Ramon SolerAmanda VidalPublished in: Int. J. Comput. Intell. Syst. (2022)
Keyphrases
- unsatisfiable cores
- branch and bound algorithm
- boolean satisfiability
- sat problem
- combinatorial optimization problems
- sat solvers
- combinatorial optimization
- max sat
- combinatorial auctions
- maximum satisfiability
- lower bound
- branch and bound
- upper bound
- hidden structure
- constraint satisfaction
- search tree
- optimal solution
- sat instances
- satisfiability problem
- constraint satisfaction problems
- np hard
- theorem proving
- defeasible logic
- probabilistic planning
- randomly generated
- inductive logic programming
- symmetry breaking
- orders of magnitude
- combinatorial problems
- np complete
- horn clauses
- optimization problems