Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,092,192 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Boolean satisfiability problem
Brute-force search
Computer science
Conjunctive normal form
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks
Tomás Balyo
,
L. Chrpa
Symposium on Combinatorial Search
2021
Corpus ID: 51876773
Algorithm configuration tools have been successfully used to speed up local search satisfiability (SAT) solvers and other…
Expand
2017
2017
PROCESS FOR LARGE-SCALE PRODUCTION OF CDTE/CDS THIN FILM SOLAR CELLS FIELD OF THE INVENTION
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…
Expand
2014
2014
Conflict-Driven XOR-Clause Learning (extended version)
Tero Laitinen
,
Tommi A. Junttila
,
I. Niemelä
arXiv.org
2014
Corpus ID: 14081702
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas…
Expand
Review
2013
Review
2013
On the Interpolation between Product-Based Message Passing Heuristics for SAT
Oliver Gableske
International Conference on Theory and…
2013
Corpus ID: 28201382
This paper introduces a notational frame to characterize the four basic product-based Message Passing (MP) heuristics currently…
Expand
2013
2013
Computing prime implicants
D. Déharbe
,
P. Fontaine
,
Daniel Le Berre
,
Bertrand Mazure
Formal Methods in Computer-Aided Design
2013
Corpus ID: 1521099
Model checking and counter-example guided abstraction refinement are examples of applications of SAT solving requiring the…
Expand
2011
2011
Evaluation of Acute Toxicity of Mercury, Cadmium and Zinc to a Freshwater Mussel Lamellidens consobrinus
P. R. Bhamre
,
S. Thorat
,
A. Desai
,
B. M. Deoray
2011
Corpus ID: 55044614
Acute toxicity testing of fresh water mussel Lamellidens consobrinus to HgCl 2 , CdCl 2 and ZnSO 4 was carried out. The median…
Expand
2005
2005
Characterization of thin film cadmium sulfide grown using a modified chemical bath deposition process
M. Archbold
,
D. Halliday
,
K. Durose
,
T. Hase
,
D. Smyth‐Boyle
,
K. Govender
Conference Record of the Thirty-first IEEE…
2005
Corpus ID: 32629297
Cadmium sulfide polycrystalline films with potential for application as a solar cell window layer have been grown by a modified…
Expand
2003
2003
Limited Address Range Architecture for Reducing Code Size in Embedded Processors
Qin Zhao
,
B. Mesman
,
H. Corporaal
Software and Compilers for Embedded Systems
2003
Corpus ID: 1651920
In embedded systems a processor core must be designed with low power consumption, low cost and small silicon area in mind since…
Expand
2002
2002
Advances in continuous, in-line processing of stable CdS/CdTe devices
W. Sampath
,
Sandeep Kohli
,
+6 authors
P. Noronha
33rd IEEE Photovoltaic Specialists Conference
2002
Corpus ID: 8239258
A continuous, in-line process suitable for high throughput manufacturing of CdS/CdTe photovoltaic devices has been demonstrated…
Expand
2000
2000
Comparison of helix-stabilizing effects of α,α-dialkyl glycines with linear and cycloalkyl side chains
S. Vijayalakshmi
,
R. Rao
,
I. Karle
,
P. Balaram
2000
Corpus ID: 29945621
The ability of \alpha, \alpha -di-n-alkyl glycines with linear and cyclic alkyl side chains to stabilize helical conformations…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE