DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories.
Nick FengAlan J. HuSam BaylessSyed M. IqbalPatrick TrentinMike WhalenLee PikeJohn BackesPublished in: TACAS (1) (2024)
Keyphrases
- max sat
- stochastic local search
- equational theories
- modulo theories
- sat solvers
- propositional formulas
- sat problem
- satisfiability problem
- search algorithm
- theorem prover
- boolean satisfiability
- propositional satisfiability
- clause learning
- theoretical framework
- cnf formula
- sat solving
- branch and bound algorithm
- lower bound
- stochastic local search algorithms
- constraint satisfaction
- theorem proving
- phase transition
- tabu search
- search space
- propositional logic
- branch and bound
- mathematical proofs
- genetic algorithm