F@BOOL@: Experiment with a simple verifying compiler based on SAT-solvers.
Nikolay V. ShilovPublished in: Autom. Control. Comput. Sci. (2011)
Keyphrases
- sat solvers
- propositional satisfiability
- sat solving
- constraint satisfaction
- max sat
- weighted max sat
- orders of magnitude
- search strategies
- boolean satisfiability
- search space
- sat instances
- clause learning sat solvers
- computational complexity
- clause learning
- search tree
- branch and bound algorithm
- co occurrence
- special case