Get started
Keyword

clause learning

Description: Clause learning is a technique in SAT solving that derives and stores clauses from conflicts to avoid repeating unproductive searches.
OpenAlex ID: keywords/clause-learning
Solving SAT and SAT Modulo Theories
2006 · Robert Nieuwenhuis, Albert Oliveras, et al. · Journal of the ACM · 783
Towards Understanding and Harnessing the Potential of Clause Learning
2004 · P. Beame, H. Kautz, et al. · Journal of Artificial Intelligence Research · 285
PDF
The Quest for Efficient Boolean Satisfiability Solvers
2002 · Lintao Zhang, Sharad Malik · Lecture notes in computer science · 279
PDF
Benefits of Bounded Model Checking at an Industrial Setting
2001 · Fady Copty, Limor Fix, et al. · Lecture notes in computer science · 189
PDF
Combining Component Caching and Clause Learning for Effective Model Counting.
2004 · Tian Sang, Fahiem Bacchus, et al. · 178
Efficient algorithms for clause-learning SAT solvers
2004 · Lawrence M. Ryan · Summit (Simon Fraser University) · 141
PDF
The effect of restarts on the efficiency of clause learning
2007 · Jinbo Huang · 133
MiniMaxSAT: An Efficient Weighted Max-SAT solver
2008 · F. Heras, J. Larrosa, et al. · Journal of Artificial Intelligence Research · 128
PDF
Using CSP look-back techniques to solve exceptionally hard SAT instances
1996 · Roberto J. Bayardo, Robert Schrag · Lecture notes in computer science · 124
On the power of clause-learning SAT solvers as resolution engines
2010 · Knot Pipatsrisawat, Adnan Darwiche · Artificial Intelligence · 122
PDF
Learning Markov logic network structure via hypergraph lifting
2009 · Stanley Kok, Pedro Domingos · International Conference on Machine Learning · 110
A theory of clausal discovery
1993 · Luc De Raedt, Maurice Bruynooghe · Lirias · 108
Discriminative structure and parameter learning for Markov logic networks
2008 · Tuyen N. Huynh, Raymond J. Mooney · International Conference on Machine Learning · 106
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
2006 · E. Giunchiglia, M. Narizzano, et al. · Journal of Artificial Intelligence Research · 106
PDF
From pauses to clauses: Prosody facilitates learning of syntactic constituency
2014 · Kara Hawthorne, LouAnn Gerken · Cognition · 95
Abstract DPLL and Abstract DPLL Modulo Theories
2005 · Robert Nieuwenhuis, Albert Oliveras, et al. · Lecture notes in computer science · 94
Heuristics for Fast Exact Model Counting
2005 · Tian Sang, Paul Beame, et al. · Lecture notes in computer science · 94
Minimizing Learned Clauses
2009 · Niklas Sörensson, Armin Biere · Lecture notes in computer science · 93
A Model-Constructing Satisfiability Calculus
2013 · Leonardo de Moura, Dejan Jovanović · Lecture notes in computer science · 92
The Community Structure of SAT Formulas
2012 · Carlos Ansótegui, Jesús Giráldez-Cru, et al. · Lecture notes in computer science · 90
Enhancing Davis Putnam with extended binary clause reasoning
2002 · Fahiem Bacchus · 87
Generalized nogoods in CSPs
2005 · George Katsirelos, Fahiem Bacchus · National Conference on Artificial Intelligence · 83
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
2011 · A. Atserias, J. K. Fichte, et al. · Journal of Artificial Intelligence Research · 80
PDF
Understanding the power of clause learning
2003 · Paul Beanie, Henry Kautz, et al. · 80
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
2010 · William Klieber, Samir Sapra, et al. · Lecture notes in computer science · 76
Works count: 583
Citation count: 7,779
Year
Topic
Type