We know DPLL
algorithm is backtracking + unit propagation + pure literal rule.
I have an example. There is one example to solve following Satisfiability problem with DPLL. if assign of "0" to variables is prior to assign "1" to variables, Which of Unit Clause (UC)
or Pure Literal (PL)
is used to solve this specific example?
{~A \/ B \/ C}, {A \/ ~B \/ C}, {A \/ B \/ ~C}, {A \/ B \/ C}
In this example wrote by using two of them (PL and UC
). why two of them is selected? any idea?