Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
DPLL
Description:
A backtracking algorithm for deciding satisfiability of propositional logic formulas, used in automated reasoning and SAT solving.
Primary topic:
Constraint Satisfaction and Optimization (35%)
Related topics:
Constraint Satisfaction and Optimization (35%),
Advancements in PLL and VCO Technologies (14%),
Formal Methods in Verification (14%)
OpenAlex ID:
keywords/dpll
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL( T )
2006
·
Robert Nieuwenhuis
, Albert Oliveras
, et al.
·
Journal of the ACM
·
1,031
Short proofs are narrow—resolution made simple
2001
·
Eli Ben-Sasson
, Avi Wigderson
·
Journal of the ACM
·
536
Towards Understanding and Harnessing the Potential of Clause Learning
2004
·
P. Beame
, H. Kautz
, et al.
·
Journal of Artificial Intelligence Research
·
346
PDF
A Lightweight Component Caching Scheme for Satisfiability Solvers
2007
·
Knot Pipatsrisawat
, Adnan Darwiche
·
Springer eBooks
·
274
Algorithms and complexity results for #SAT and Bayesian inference
2004
·
F. Bacchus
, S. Dalmao
, et al.
·
Annual Symposium on Foundations of Computer Science
·
190
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
2002
·
Reinhold Letz
·
Lecture notes in computer science
·
164
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
2011
·
A. Atserias
, J. K. Fichte
, et al.
·
Journal of Artificial Intelligence Research
·
151
PDF
Lazy Annotation for Program Testing and Verification
2010
·
Kenneth L. McMillan
·
Lecture notes in computer science
·
148
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
2002
·
Gilles Audemard
, Piergiorgio Bertoli
, et al.
·
Lecture notes in computer science
·
145
NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances
2005
·
Sathiamoorthy Subbarayan
, Dhiraj K. Pradhan
·
Lecture notes in computer science
·
137
A New Approach to Model Counting
2005
·
Wei Wei
, Bart Selman
·
Lecture notes in computer science
·
125
A logical approach to efficient Max-SAT solving
2007
·
Javier Larrosa
, Federico Heras
, et al.
·
Artificial Intelligence
·
116
PDF
Enhancing Davis Putnam with extended binary clause reasoning
2002
·
Fahiem Bacchus
·
National Conference on Artificial Intelligence
·
111
Refining Restarts Strategies for SAT and UNSAT
2012
·
Gilles Audemard
, Laurent Simon
·
Lecture notes in computer science
·
109
DPLL bit synchronizer with rapid acquisition using adaptive Kalman filtering techniques
1994
·
P.F. Driessen
·
IEEE Transactions on Communications
·
98
Understanding the power of clause learning
2003
·
Paul Beanie
, Henry Kautz
, et al.
·
International Joint Conference on Artificial Intelligence
·
91
Generalizing DPLL to Richer Logics
2009
·
Kenneth L. McMillan
, Andreas Kuehlmann
, et al.
·
Lecture notes in computer science
·
72
PDF
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
2018
·
Jasmin Christian Blanchette
, Mathias Fleury
, et al.
·
Journal of Automated Reasoning
·
70
PDF
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
2005
·
Zhao Xing
, Weixiong Zhang
·
Artificial Intelligence
·
70
PDF
Using DPLL for Efficient OBDD Construction
2005
·
Jinbo Huang
, Adnan Darwiche
·
Lecture notes in computer science
·
66
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively
2007
·
H. Jia
, C. Moore
, et al.
·
Journal of Artificial Intelligence Research
·
62
PDF
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
2007
·
Sava Krstić
, Amit Goel
·
Lecture notes in computer science
·
61
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)
2000
·
Fausto Giunchiglia
, Roberto Sebastiani
·
Information and Computation
·
56
On-the-Fly Clause Improvement
2009
·
Hyojung Han
, Fabio Somenzi
·
Lecture notes in computer science
·
52
Clause learning can effectively P-simulate general propositional resolution
2008
·
Philipp Hertel
, Fahiem Bacchus
, et al.
·
National Conference on Artificial Intelligence
·
52
Show more works
View as search
Works count:
301
Citation count:
5,637
Year
Topic
Type