Clause Redundancy and Preprocessing in Maximum Satisfiability.
Hannes IhalainenJeremias BergMatti JärvisaloPublished in: IJCAR (2022)
Keyphrases
- preprocessing
- maximum satisfiability
- boolean satisfiability
- max sat
- cnf formula
- sat problem
- combinatorial problems
- search space
- boolean formula
- branch and bound algorithm
- lower bound
- randomly generated
- sat solvers
- orders of magnitude
- domain specific
- theorem prover
- phase transition
- constraint satisfaction
- graph coloring
- np hard