Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research… 
2011
2011
Hybrid Dynamical Systems Extending DPLL for Pseudo-Boolean Constraints Integration of DPLL-SAT and Linear Programming Integration… 
2011
2011
Satisfiability (SAT) solvers often benefit from clauses learned by the DPLL procedure, even though they are by definition… 
2009
2009
Search-based techniques in propositional satisfiability (SAT) solving have been enormously successful, leading to what is… 
2009
2009
Bifurcation theory is very important in digital phaselocked loops (DPLLs) which are frequently encountered in radio engineering… 
1989
1989
A design of an all-digital phase-locked loop (DPLL) with direct frequency synthesis is proposed for generating signals that… 
1986
1986
A fault-tolerant network clock regenerator (NCR) will be analyzed, which consists of two digital phase-locked loops (DPLL), and… 
1985
1985
The performance of a first-order digital phase-locked loop (DPLL) using nonuniform sampling is studied in the mobile radio… 
1984
1984
A nonuniform sampling digital phase-locked loop (DPLL) is proposed with a sequential loop filter, in which two additional phase…