As SAT-algorithms become more and more complex, there is little chance of writing a SAT-solver that is free of bugs. So it is of great importance to be able to verify, the information returned by a SAT-solver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can b...
No comments yet
Be the first to share your thoughts!