DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories.
Nick FengAlan J. HuSam BaylessSyed M. IqbalPatrick TrentinMike WhalenLee PikeJohn BackesPublished in: CoRR (2024)
Keyphrases
- max sat
- equational theories
- stochastic local search
- modulo theories
- sat solvers
- propositional formulas
- sat problem
- theorem prover
- cnf formula
- satisfiability problem
- search algorithm
- lower bound
- boolean satisfiability
- propositional satisfiability
- branch and bound algorithm
- branch and bound
- phase transition
- decision procedures
- theorem proving
- clause learning
- orders of magnitude
- stochastic local search algorithms
- constraint satisfaction
- evolutionary algorithm
- mathematical proofs
- satisfiability modulo theories
- sat solving
- propositional logic
- search strategies
- computational models