Satisfiability Problem · Algorithms for SAT (Optional)
Lesson 2
Below is an example of the backtracking algorithm. The recursion tree shows that the formula is unsatisfiable.
=1/image0.png)
Satisfiability Problem · Algorithms for SAT (Optional)
Below is an example of the backtracking algorithm. The recursion tree shows that the formula is unsatisfiable.
=1/image0.png)