A Theory of Satisfiability-Preserving Proofs in SAT Solving.
Adrián Rebola-PardoMartin SudaPublished in: LPAR (2018)
Keyphrases
- sat solving
- sat problem
- sat solvers
- satisfiability problem
- symmetry breaking
- sat instances
- boolean optimization
- sat encodings
- boolean satisfiability
- max sat
- np complete
- evolutionary algorithm
- optimal solution
- genetic algorithm
- constraint satisfaction
- theorem proving
- orders of magnitude
- constraint satisfaction problems
- simulated annealing