CDCL — Conflict-Driven Clause Learning

Fact

A SAT solver method that learns extra constraints from conflicts.

In Plain Words

CDCL is like a kid in a corn maze with a marker. Every dead end gets a big NOPE sign, so whole paths get skipped.

It powers SAT solvers. It helps check designs and plan steps by turning dead ends into shortcuts.

Related Concepts

• Davis–Putnam–Logemann–Loveland algorithm
• Constraint Satisfaction Problem
• Resolution Principle
• Automated Theorem Proving

DPLL
CDCL adds conflict learning to DPLL backtracking search.

CSP
SAT is a Boolean CSP, and CDCL is built to solve it.

Resolution
A new clause learned by CDCL can act like a Resolution step.

ATP
Modern ATP often hands SAT solving to CDCL.