Using Resolution Proofs to Analyse CDCL Solvers.
Janne I. KokkalaJakob NordströmPublished in: CP (2020)
Keyphrases
- clause learning
- sat solvers
- unit propagation
- sat solving
- satisfiability problem
- propositional satisfiability
- sat problem
- boolean satisfiability
- orders of magnitude
- davis putnam
- search tree
- search strategies
- max sat
- sat instances
- sat encodings
- theorem prover
- theorem proving
- search space
- temporal logic
- conjunctive normal form
- branch and bound