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… 
2018
2018
Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and… 
2014
2014
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas… 
2011
2011
The emergence of high-density wireless local area network (WLAN) deployments in recent years is a testament to the insatiable… 
2009
2009
In the current organisation of air traffic control, some cooperative activities appear in the work of air traffic controllers… 
2006
2006
Time-resolved photoluminescence (TRPL) computer simulations demonstrate that under certain experimental conditions it is possible… 
2005
2005
Cadmium sulfide polycrystalline films with potential for application as a solar cell window layer have been grown by a modified… 
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…