Live briefing
Everything about DPLL algorithm
Type of search algorithm
In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: DPLL algorithmA 5-minute orientation
- Skim a recent paper: A novel timing recovery algorithm for digital multi-band systems with enhanced DPLL performanceInfluential work since 2022
- Read the landmark paper: Dual-loop DPLL gear-shifting algorithm for fast synchronizationCited 22 times
- Go sideways: Conflict-driven clause learningA closely related topic
- Go sideways: Davis–Putnam algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Dual-loop DPLL gear-shifting algorithm for fast synchronization
Visualizing SAT Instances and Runs of the DPLL Algorithm
An Exhaustive DPLL Algorithm for Model Counting
An asynchronous P system with a DPLL algorithm for solving SAT
Research on Pulsar Time Steered Atomic Time Algorithm Based on DPLL
Single and Multi-frequency Parameter Estimation by $${\alpha}$$SWIFT-DPLL Through Optimized MOPSO Algorithm
Verifying the DPLL Algorithm in Dafny
A Verified Implementation of the DPLL Algorithm in Dafny
🆕 Influential since 2022
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- 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 formula…
- Davis–Putnam algorithm In logic and computer science, the Davis–Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic…
- Boolean satisfiability problem In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY…
- Resolution (logic) In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a sound and refutation-complete theorem-proving technique…
- SAT solver In computer science and formal methods, a SAT solver is a computer program which aims to solve the Boolean satisfiability problem (SAT). On input a formula…
- 2-satisfiability In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values…
- ♯SAT In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretati…
- Unit propagation Unit propagation (UP) or boolean constraint propagation (BCP) or the one-literal rule (OLR) is a procedure of automated theorem proving that can simplify…