# DPLL algorithm

In computer science, the **Davis–Putnam–Logemann–Loveland (DPLL) algorithm** is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem.

It was introduced in 1962 by Martin Davis, Hilary Putnam, George Logemann and Donald W. Loveland and is a refinement of the earlier Davis–Putnam algorithm, which is a resolution-based procedure developed by Davis and Putnam in 1960. Especially in older publications, the Davis–Logemann–Loveland algorithm is often referred to as the “Davis–Putnam method” or the “DP algorithm”. Other common names that maintain the distinction are DLL and DPLL.

After almost 50 years the DPLL procedure still forms the basis for most efficient complete SAT solvers. It has recently been extended for automated theorem proving for fragments of first-order logic.^{[1]}

## Implementations and applications

The SAT problem is important both from theoretical and practical points of view. In complexity theory it was the first problem proved to be NP-complete, and can appear in a broad variety of applications such as *model checking*, automated planning and scheduling, and diagnosis in artificial intelligence.

As such, it was and still is a hot topic in research for many years, and competitions between SAT solvers regularly take place.^{[2]} DPLL's modern implementations like Chaff and zChaff,^{[3]}^{[4]} GRASP or Minisat^{[5]} are in the first places of the competitions these last years.

Another application which often involves DPLL is *automated theorem proving* or *Satisfiability Modulo Theories* (SMT) which is a SAT problem in which propositional variables are replaced with formulas of another mathematical theory.

## The algorithm

The basic backtracking algorithm runs by choosing a literal, assigning a truth value to it, simplifying the formula and then recursively checking if the simplified formula is satisfiable; if this is the case, the original formula is satisfiable; otherwise, the same recursive check is done assuming the opposite truth value. This is known as the *splitting rule*, as it splits the problem into two simpler sub-problems. The simplification step essentially removes all clauses which become true under the assignment from the formula, and all literals that become false from the remaining clauses.

The DPLL algorithm enhances over the backtracking algorithm by the eager use of the following rules at each step:

- Unit propagation
- If a clause is a
*unit clause*, i.e. it contains only a single unassigned literal, this clause can only be satisfied by assigning the necessary value to make this literal true. Thus, no choice is necessary. In practice, this often leads to deterministic cascades of units, thus avoiding a large part of the naive search space.

- Pure literal elimination
- If a propositional variable occurs with only one polarity in the formula, it is called
*pure*. Pure literals can always be assigned in a way that makes all clauses containing them true. Thus, these clauses do not constrain the search anymore and can be deleted.

Unsatisfiability of a given partial assignment is detected if one clause becomes empty, i.e. if all its variables have been assigned in a way that makes the corresponding literals false. Satisfiability of the formula is detected either when all variables are assigned without generating the empty clause, or, in modern implementations, if all clauses are satisfied. Unsatisfiability of the complete formula can only be detected after exhaustive search.

The DPLL algorithm can be summarized in the following pseudocode, where Φ is the CNF formula:

Input: A set of clauses Φ. Output: A Truth Value.

functionDPLL(Φ)ifΦ is a consistent set of literalsthenreturntrue;ifΦ contains an empty clausethenreturnfalse;for everyunit clauselinΦ Φ ←unit-propagate(l, Φ);for everyliterallthat occurs pureinΦ Φ ←pure-literal-assign(l, Φ);l←choose-literal(Φ);returnDPLL(Φ∧l)orDPLL(Φ∧not(l));

Template:Algorithm-end
In this pseudocode, `unit-propagate(l, Φ)`

and `pure-literal-assign(l, Φ)`

are functions that return the result of applying unit propagation and the pure literal rule, respectively, to the literal `l`

and the formula `Φ`

. In other words, they replace every occurrence of `l`

with "true" and every occurrence of `not l`

with "false" in the formula `Φ`

, and simplify the resulting formula.
The

in the **or**

statement is a short-circuiting operator. **return**`Φ `

denotes the simplified result of substituting "true" for **^** l`l`

in `Φ`

.

The pseudocode DPLL function only returns whether the final assignment satisfies the formula or not. In a real implementation, the partial satisfying assignment typically is also returned on success; this can be derived from the consistent set of literals of the first `if`

statement of the function.

The Davis–Logemann–Loveland algorithm depends on the choice of *branching literal*, which is the literal considered in the backtracking step. As a result, this is not exactly an algorithm, but rather a family of algorithms, one for each possible way of choosing the branching literal. Efficiency is strongly affected by the choice of the branching literal: there exist instances for which the running time is constant or exponential depending on the choice of the branching literals. Such choice functions are also called heuristic functions or branching heuristics.^{[6]}

## Current work

In the 2010s years, work on improving the algorithm has been done on three directions:

- Defining different policies for choosing the branching literals.
- Defining new data structures to make the algorithm faster, especially the part on
**unit propagation** - Defining variants of the basic backtracking algorithm. The latter direction include
*non-chronological backtracking*(aka.*backjumping*) and*clause learning*. These refinements describe a method of backtracking after reaching a conflict clause which "learns" the root causes (assignments to variables) of the conflict in order to avoid reaching the same conflict again. The resulting Conflict-Driven Clause Learning SAT solvers are the state of the art in 2014.

A newer algorithm from 1990 is Stålmarck's method. Also since 1986 (reduced ordered) binary decision diagrams have also been used for SAT solving.

## Relation to other notions

Runs of DPLL-based algorithms on unsatisfiable instances correspond to tree resolution refutation proofs.^{[7]}

## See also

## References

**General**

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

**Specific**

- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ Template:Cite web
- ↑ Template:Cite doi
- ↑ {{#invoke:citation/CS1|citation |CitationClass=book }}

## Further reading

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}