Construct · 1 fields · 1 citations

DPLL algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
DPLLalgorithm1 CONSTRUCTDPLL algorithmDAVIS · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a backtracking search procedure for propositional satisfiability that combines branching on variables with unit propagation and pure-literal elimination.

In algorithms and data structures, DPLL algorithm refers to a backtracking search procedure for propositional satisfiability that combines branching on variables with unit propagation and pure-literal elimination. This meaning comes from Davis (1962) in Communications of the ACM.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how DPLL algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

branching3 fields · 4 citationsjingle · one word, three constructselimination4 fields · 7 citationsjingle · one word, four constructspropagation2 fields · 2 citationsjingle · one word, two constructs

References

  1. Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem-proving. Communications of the ACM, 5(7), 394-397. https://doi.org/10.1145/368273.368557

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct