A Flexible Proof Format for SAT Solver-Elaborator Communication.
Seulkee BaekMario CarneiroMarijn J. H. HeulePublished in: CoRR (2021)
Keyphrases
- sat solvers
- clause learning sat solvers
- orders of magnitude
- sat solving
- propositional satisfiability
- sat problem
- boolean satisfiability
- search tree
- constraint satisfaction
- max sat
- search strategies
- search space
- sat instances
- theorem proving
- boolean formula
- constraint solver
- sat encodings
- unsatisfiable cores
- satisfiability problem
- propositional theories
- dynamic programming