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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2017
010203019912017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In the original publication of the article, the reference 11 was omitted inadvertently. 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Conflict-Driven Clause-Learning (CDCL) SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS… (More)
  • table 1
  • table 2
  • table 4
  • figure 1
  • figure 2
Is this relevant?
2014
2014
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
2013
2013
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which combines search for a model… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Review
2009
Review
2009
One of the main reasons for the widespread use of SAT in many applications is that Conflict-Driven Clause Learning (CDCL) Boolean… (More)
  • figure 4.1
  • figure 4.2
  • table 4.1
  • table 4.2
  • figure 4.3
Is this relevant?
2009
2009
This article introduces SATHYS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2008
2008
–Conflict-Driven Clause Learning: – are believed to be well-known: ∗ They embed dynamic heuristics [6, 3], learning [7], restarts… (More)
Is this relevant?