Skip to main content
Conference Proceedings

Present and future of practical SAT solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5250 LNCS 283-319
DOI: 10.1007/978-3-540-92800-3_11
8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We review current SAT solving, concentrating on the two paradigms of conflict-driven and look-ahead solvers, and with a view towards the unification of these two paradigms. A general "modern" scheme for DPLL algorithms is presented, which allows natural representations for "modern" solvers of these two types. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kullmann, O. (2008). Present and future of practical SAT solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5250 LNCS, pp. 283–319). https://doi.org/10.1007/978-3-540-92800-3_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free