DPLL algorithm

Known as: Davis-Putnam-Logemann-Loveland algorithm, Davis–Putnam–Logemann–Loveland algorithm, DPLL-Algorithm 
In computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Dependency Quantified Boolean Formulas (DQBF) comprise the set of propositional formulas which can be formulated by adding Henkin… (More)
Is this relevant?
2012
2012
We formalize a completeness proof for the DPLL proof system and extract a DPLL SAT solver from it. When applied to a… (More)
Is this relevant?
2009
2009
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for… (More)
Is this relevant?
2006
2006
We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in the DPLL(T ) framework. The new… (More)
  • figure 2.1
  • figure 3.4
  • table 5.1
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
State of the art SAT solvers typically solve CNF encoded SAT theories using DPLL based algorithms [1]. However, many problems are… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2004
2004
The DPLL procedure has found great success in SAT, where search terminates on the first solution discovered. We show that this… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Bayesian inference is an important problem with numerous ap plications in probabilistic reasoning. Counting satisfyi ng… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We describe and discuss DPLL(T ), a parametric calculus for proving the satisfiability of ground formulas in a logical theory T… (More)
  • figure 1
  • figure 2
Is this relevant?