Skip to search formSkip to main contentSkip to account menu

Conflict-Driven Clause Learning

Known as: CDCL, Conflict Driven Clause Learning 
In computer science, Conflict-Driven Clause Learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
Algorithm configuration tools have been successfully used to speed up local search satisfiability (SAT) solvers and other… 
2017
2017
  • 2017
  • Corpus ID: 174777619
A process for large-scale production of CdTe/CdS thin film Solar cells, films of the cells being deposited, in Sequences on a… 
2014
2014
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas… 
Review
2013
Review
2013
This paper introduces a notational frame to characterize the four basic product-based Message Passing (MP) heuristics currently… 
2013
2013
Model checking and counter-example guided abstraction refinement are examples of applications of SAT solving requiring the… 
2011
2011
Acute toxicity testing of fresh water mussel Lamellidens consobrinus to HgCl 2 , CdCl 2 and ZnSO 4 was carried out. The median… 
2005
2005
Cadmium sulfide polycrystalline films with potential for application as a solar cell window layer have been grown by a modified… 
2003
2003
In embedded systems a processor core must be designed with low power consumption, low cost and small silicon area in mind since… 
2002
2002
A continuous, in-line process suitable for high throughput manufacturing of CdS/CdTe photovoltaic devices has been demonstrated… 
2000
2000
The ability of \alpha, \alpha -di-n-alkyl glycines with linear and cyclic alkyl side chains to stabilize helical conformations…