11. However, constraint propagation can be used to prove satisfiability in some cases. 12. The problem of satisfiability on the class of binary acyclic problem is tractable. 13. The Horn satisfiability problem can also be asked for propositional many-valued logics. 14. A closely related approach to planning is the Planning as Satisfiability ( Satplan ). 15. The approach to planning that converts planning problems into Boolean satisfiability problems is called satplan. 16. The algorithm is similar to WalkSAT which is used to solve general boolean satisfiability problems. 17. The 3-satisfiability or, as Karp did, by reduction from the clique problem. 18. A plan can be found by testing the satisfiability of the formulas for different horizon lengths. 19. Bucket elimination is a satisfiability algorithm. 20. This idea can be implemented by checking only satisfiability or unsatisfiability of variable / value pairs.
