Higher-Order Quantified Boolean Satisfiability.
Dmitry ChistikovChristoph HaaseZahra HadizadehAlessio MansuttiPublished in: MFCS (2022)
Keyphrases
- boolean satisfiability
- higher order
- sat solvers
- branch and bound algorithm
- boolean optimization
- probabilistic planning
- randomly generated
- sat problem
- sat solving
- symmetry breaking
- combinatorial problems
- integer linear programming
- phase transition
- maximum satisfiability
- sat instances
- max sat
- satisfiability problem
- lower bound
- propositional satisfiability
- evolutionary algorithm
- constraint programming
- combinatorial optimization
- tabu search
- orders of magnitude
- scheduling problem
- random sat instances