A verified SAT solver with watched literals using imperative HOL.
Mathias FleuryJasmin Christian BlanchettePeter LammichPublished in: CPP (2018)
Keyphrases
- sat solvers
- boolean formula
- answer sets
- orders of magnitude
- sat solving
- constraint satisfaction
- sat problem
- propositional satisfiability
- boolean satisfiability
- search strategies
- max sat
- search space
- search tree
- sat instances
- theorem prover
- constraint solver
- answer set programming
- binary decision diagrams
- unsatisfiable cores
- genetic algorithm
- sat encodings
- inductive logic programming
- objective function