Towards Understanding and Harnessing the Potential of Clause Learning

@article{Beame2004TowardsUA,
  title={Towards Understanding and Harnessing the Potential of Clause Learning},
  author={Paul Beame and Henry A. Kautz and Ashish Sabharwal},
  journal={J. Artif. Intell. Res.},
  year={2004},
  volume={22},
  pages={319-351}
}
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problems, such as verification, planning and design. Despite its importance, little is known of the ultimate strengths and limitations of the technique. This paper presents the first precise characterization of clause learning as a proof system (CL), and begins the task of understanding its power by relating it to the well… CONTINUE READING
Highly Influential
This paper has highly influenced 30 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 312 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 188 extracted citations

Producing and verifying extremely large propositional refutations

Annals of Mathematics and Artificial Intelligence • 2012
View 8 Excerpts
Highly Influenced

312 Citations

0102030'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 312 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 49 references

Efficient conflict driven learning in a Boolean satisfiability solver

IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281) • 2001
View 7 Excerpts
Highly Influenced

GRASP-A new search algorithm for satisfiability

Proceedings of International Conference on Computer Aided Design • 1996
View 7 Excerpts
Highly Influenced

Optimality of size-width tradeoffs for resolution

computational complexity • 2001
View 4 Excerpts
Highly Influenced

Near-Optimal Separation of Treelike and General Resolution

Electronic Colloquium on Computational Complexity • 2000
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…