Article

Efficient conflict driven learning in a boolean satisfiability solver

Authors:

Conor F. Madigan,

Matthew H. Moskewicz,

Sharad MalikAuthors Info & Claims

ICCAD '01: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design

Pages 279 - 285

Published: 04 November 2001 Publication History

Abstract

One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Extensive experiments with real world examples show that the best performing new learning scheme has at least a 2X speedup compared with learning schemes employed in state-of-the-art SAT solvers.

References

[1]

P. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Combinational Test Generation Using Satisfiability," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, 1167-1176, 1996.]]

Digital Library

[2]

M. Velev, and R. Bryant, "Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors," Proceedings of the Design Automation Conference, July 2001.]]

Digital Library

[3]

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. "Symbolic Model Checking without BDDs," Tools and Algorithms for the Analysis and Construction of Systems (TACAS'99), number 1579 in LNCS. Springer-Verlag, 1999.)]]

Digital Library

[4]

B. Selman, H. Kautz, and B. Cohen. "Local Search Strategies for Satisfiability Testing." DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, AMS, 1996.]]

[5]

J. W. Freeman, "Improvements to Propositional Satisfiability Search Algorithms," Ph.D. Dissertation, Department of Computer and Information Science, University of Pennsylvania, May 1995.]]

Digital Library

[6]

J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Propositional Satisfiability," IEEE Transactions on Computers, vol. 48, 506-521, 1999.]]

Digital Library

[7]

R. Bayardo, and R. Schrag, "Using CSP look-back techniques to solve real-world SAT instances," Proceedings of the 14th Nat. (US) Conf. on Artificial Intelligence (AAAI-97), AAAI Press/The MIT Press, 1997.]]

[8]

H. Zhang. "SATO: An efficient propositional prover," Proceedings of the International Conference on Automated Deduction, July 1997.]]

Digital Library

[9]

M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. "Chaff: Engineering an efficient SAT Solver," Proceedings of the Design Automation Conference, July 2001.]]

Digital Library

[10]

M. Davis, G. Logemann, and D. Loveland. "A machine program for theorem proving.," Communications of the ACM, (5):394-397, 1962.]]

Digital Library

[11]

G. Stalmarck, "A system for determining prepositional logic theorems by applying values and rules to triplets that are generated from a formula," Technical report, European Patent N 0403 454 (1995), US Patent N 5 27689.]]

[12]

M. Moskewicz, L. Zhang, Y. Zhao, S. Malik and C. Madigan, "Chaff: A Fast SAT Solver for EDA Applications", Presented at the Dagstuhl seminar on SAT v.s. BDD, March 2001. Dagstuhl, Germany.]]

[13]

J. P. Marques-Silva, "The Impact of Branching Heuristics in Propositional Satisfiability Algorithms," Proceedings of the 9th Portuguese Conference on Artificial Intelligence (EPIA), September 1999.]]

Digital Library

[14]

Chu Min Li and Anbulagan, "Heuristics based on unit propagation for satisfiability problems," Proceedings of the fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), Pages 366-371, Nagoya (Japan), 1997]]

[15]

Chu Min Li, "Integrating equivalency reasoning into Davis-Putnam Procedure," Proceedings of AAAI 2000, 2000.]]

Digital Library

[16]

C. P. Gomes, B. Selman, and H. Kautz, "Boosting Combinatorial Search Through Randomization", Proceedings of AAAI-98, Madison, WI, 1998.]]

Digital Library

[17]

A. Goldberg, R. Tarjan. "A new approach to the maximum flow problem," Proceedings of the eighteenth annual ACM Symposium on Theory of Computing, 1986.]]

Digital Library

[18]

Bounded Model Checking benchmarks available at http://www.cs.cmu.edu/~modelcheck/bmc/bmc-benchmarks.html]]

[19]

M. N. Velev, Microprocessor Formal Verification Benchmarks, available at http://www.ece.cmu.edu/~mvelev]]

Cited By

Mishra AJagannathan S(2022)Specification-guided component-based synthesis from effectful librariesProceedings of the ACM on Programming Languages10.1145/35633106:OOPSLA2(616-645)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563310
Meng YGay G(2020)Understanding The Impact of Solver Choice in Model-Based Test GenerationProceedings of the 14th ACM / IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM)10.1145/3382494.3410674(1-11)Online publication date: 5-Oct-2020
https://dl.acm.org/doi/10.1145/3382494.3410674
Poeplau SFrancillon ABalenson D(2019)Systematic comparison of symbolic execution systemsProceedings of the 35th Annual Computer Security Applications Conference10.1145/3359789.3359796(163-176)Online publication date: 9-Dec-2019
https://dl.acm.org/doi/10.1145/3359789.3359796
Show More Cited By

Recommendations

Conflict driven learning in a quantified Boolean Satisfiability solver
ICCAD '02: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design

Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification problems can be formulated as QBF instances. A closely related research ...
A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiability

We present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSAT_CNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...
Backjumping for quantified Boolean logic satisfiability

The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICCAD '01: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design

November 2001

656 pages

ISBN:0780372492

Conference Chair:
Rolf Ernst
Tech. Univ. of Braunschweig, Braunschweig, Germany

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
IEEE Circuits & Systems Society
The IEEE Computer Society DATC

Publisher

IEEE Press

Publication History

Published: 04 November 2001

Check for updates

Qualifiers

Article

Conference

ICCAD01

Sponsor:

SIGDA

ICCAD01: International Conference on Computer Aided Design

November 4 - 8, 2001

California, San Jose

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Upcoming Conference

ICCAD '24

Sponsor:
sigda

IEEE/ACM International Conference on Computer-Aided Design

October 27 - 31, 2024

New York , NY , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

192
Total Citations
View Citations
1,197
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)3

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mishra AJagannathan S(2022)Specification-guided component-based synthesis from effectful librariesProceedings of the ACM on Programming Languages10.1145/35633106:OOPSLA2(616-645)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563310
Meng YGay G(2020)Understanding The Impact of Solver Choice in Model-Based Test GenerationProceedings of the 14th ACM / IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM)10.1145/3382494.3410674(1-11)Online publication date: 5-Oct-2020
https://dl.acm.org/doi/10.1145/3382494.3410674
Poeplau SFrancillon ABalenson D(2019)Systematic comparison of symbolic execution systemsProceedings of the 35th Annual Computer Security Applications Conference10.1145/3359789.3359796(163-176)Online publication date: 9-Dec-2019
https://dl.acm.org/doi/10.1145/3359789.3359796
Bogaerts BWeinzierl A(2018)Exploiting justifications for lazy grounding of answer set programsProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3304900(1737-1745)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304889.3304900
Feng YMartins RBastani ODillig I(2018)Program synthesis using conflict-driven learningACM SIGPLAN Notices10.1145/3296979.319238253:4(420-435)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192382
Feng YMartins RBastani ODillig IFoster JGrossman D(2018)Program synthesis using conflict-driven learningProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192382(420-435)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192382
Dai SLiu GZhang ZAnderson JBazargan K(2018)A Scalable Approach to Exact Resource-Constrained Scheduling Based on a Joint SDC and SAT FormulationProceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/3174243.3174268(137-146)Online publication date: 15-Feb-2018
https://dl.acm.org/doi/10.1145/3174243.3174268
Jabbour SEl Mazouri FSais L(2018)Mining Negatives Association Rules Using ConstraintsProcedia Computer Science10.1016/j.procs.2018.01.146127:C(481-488)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1016/j.procs.2018.01.146
Yin XToroczkai ZHu XParameswaran S(2017)An analog SAT solver based on a deterministic dynamical systemProceedings of the 36th International Conference on Computer-Aided Design10.5555/3199700.3199806(794-799)Online publication date: 13-Nov-2017
https://dl.acm.org/doi/10.5555/3199700.3199806
Luo MLi CXiao FManyà FLü Z(2017)An effective learnt clause minimization approach for CDCL SAT solversProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171743(703-711)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171743
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents