Construct · 1 fields · 1 citations

conflict-driven clause learning: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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 satisfiability-solving method that analyzes each conflict to learn a new clause and backjumps non-chronologically, the basis of modern SAT solvers.

In algorithms and data structures, conflict-driven clause learning refers to a satisfiability-solving method that analyzes each conflict to learn a new clause and backjumps non-chronologically, the basis of modern SAT solvers. This meaning comes from Marques-Silva (1999) in IEEE Transactions on Computers.[1]

Unit
Recovery means
Measured by

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

See how conflict-driven clause learning sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

basis3 fields · 5 citationsjingle · one word, three constructs clause2 fields · 3 citationsjingle · one word, two constructs conflict4 fields · 5 citationsjingle · one word, four constructs

References

Marques-Silva, J. P., & Sakallah, K. A. (1999). GRASP: a search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5), 506-521. https://doi.org/10.1109/12.769433

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