DP algorithm Conflict-Driven Clause Learning

the dp algorithm has been introduced davis , putnam in 1960. informally, algorithm iteratively performs following steps until no more variables left in formula:

select variable



a


{\displaystyle a}

, add non-tautological resolvents upon



a


{\displaystyle a}

(a resolvent non-tautological if not contain



v


{\displaystyle v}

,



¬
v


{\displaystyle \neg v}

variable



v


{\displaystyle v}

).
remove original clauses contain



a


{\displaystyle a}

.

see more details here dp algorithm