Article

Resolve and expand

Author:

Armin BiereAuthors Info & Claims

SAT'04: Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Pages 59 - 70

https://doi.org/10.1007/11527695_5

Published: 10 May 2004 Publication History

Abstract

We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantified variables and eliminate universal variables by expansion. This process is continued until the formula becomes propositional and can be solved by any SAT solver. On structured problems our implementation quantor is competitive with state-of-the-art QBF solvers based on DPLL. It is orders of magnitude faster on certain hard to solve instances.

References

[1]

A. Ayari and D. Basin. QUBOS: deciding quantified boolean logic using propositional satisfiability solvers. In Proc. 4th Intl. Conf. on Formal Methods in Computer-Aided Design (FMCAD'02), volume 2517 of LNCS. Springer, 2002.

Digital Library

[2]

P. Aziz Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT-solvers. In Proc. 6th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of LNCS. Springer, 2000.

Digital Library

[3]

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In Proc. 5th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of LNCS. Springer, 1999.

Digital Library

[4]

M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. 16th National Conference on Artificial Intelligence (AAAI-98), 1998.

Digital Library

[5]

P. Chatalic and L. Simon. ZRes: The old Davis-Putnam procedure meets ZBDDs. In 17th Intl. Conf. on Automated Deduction (CADE'17), volume 1831 of LNAI, 2000.

Digital Library

[6]

P. Chauhan, E. M. Clarke, and D. Kröning. Using SAT based image computation for reachability analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University, 2003.

[7]

M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5, 1962.

Digital Library

[8]

M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7, 1960.

Digital Library

[9]

E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for quantified boolean logic satisfiability. In Proc. 18th National Conference on Artificial Intelligence (AAAI'02), 2002.

Digital Library

[10]

H. Kleine Büning, M. Karpinski, and A. Flögel. Resolution for quantified boolean formulas. Information and Computation, 117, 1995.

Digital Library

[11]

D. Le Berre, L. Simon, and A. Tacchella. Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers. In Proc. 6th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'03), volume 2919 of LNCS. Springer, 2003.

[12]

R. Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In Proc. Intl. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'02), volume 2381 of LNCS. Springer, 2002.

Digital Library

[13]

K. L. McMillan. Symbolic Model Checking: An approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.

Digital Library

[14]

K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. 14th Intl. Conf. on Computer-Aided Verification (CAV'02), volume 2404 of LNCS. Springer, July 2002.

Digital Library

[15]

M. Mneimneh and K. Sakallah. Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In Proc. 6th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'03), volume 2919 of LNCS. Springer, 2003.

[16]

D. Plaisted, A. Biere, and Y. Zhu. A satisfiability procedure for quantified boolean formulae. Discrete Applied Mathematics, 130(2), 2003.

Digital Library

[17]

J. Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified boolean formulae. In International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'01), 2001.

Digital Library

[18]

W. J. Savitch. Relation between nondeterministic and deterministic tape complexity. Journal of Computer and System Sciences, 4, 1970.

Digital Library

[19]

R. Sekar, I. V. Ramakrishnan, and A. Voronkov. Term indexing. In Handbook of Automated Reasoning, volume II. North-Holland, 2001.

Digital Library

[20]

L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In 5th Annual ACM Symposium on the Theory of Computing, 1973.

Digital Library

[21]

P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining decision diagrams and SAT procedures for efficient symbolic model checking. In Proc. 12th Intl. Conf. on Computer Aided Conf. Verification (CAV'00), volume 1855 of LNCS. Springer, 2000.

Digital Library

[22]

L. Zhang and S. Malik. Conflict driven learning in a quantified boolean satisfiability solver. In Proc. Intl. Conf. on Computer-Aided Design (ICCAD'02), 2002.

Digital Library

Cited By

Seidl M(2023)Never Trust Your Solver: Certification for SAT and QBFIntelligent Computer Mathematics10.1007/978-3-031-42753-4_2(16-33)Online publication date: 4-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-42753-4_2
Schlaipfer MSlivovsky FWeissenbacher GZuleger FPulina LSeidl MChew LHeule MVallade VLe Frioux LBaarir SSopena JGanesh VKordon FFeng NBacchus FHickey RBacchus FMöhle SSebastiani RBiere AShaw AMeel KLorenz JWörz FAudemard GPaulevé LSimon LHeisinger MFleury MBiere ANabeshima HInoue KKochemazov SMull NPang SRazborov ABonet MLevy JVinyals MElffers JJohannsen JNordström JYolcu EWu XHeule MLarrosa JRollon ELi CFleming NVinyals MPitassi TGanesh VAgrawal DBhavishya Meel KSlivovsky FSzeider SBerg JBacchus FPoole AFilmus YMahajan MSood GVinyals Mde Colnet ALe Berre DMarquis PWallon RMencía CMarques-Silva JHecher MThier PWoltran SSeed TKing AEvans NJonáš MStrejček JBeyersdorff OBlinkhorn JPeitl TShukla ASlivovsky FSzeider SSchlaipfer MSlivovsky FWeissenbacher GZuleger FMayer-Eichberger VSaffidine AAnderson MJi ZXu AČeška MMatyáš JMrazek VVojnar TEhlers RTreutler KWesling VJanota MMorgado AKarpiński MPiotrów M(2020)Multi-linear Strategy Extraction for QBF Expansion Proofs via Local SoundnessTheory and Applications of Satisfiability Testing – SAT 202010.1007/978-3-030-51825-7_30(429-446)Online publication date: 3-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-51825-7_30
Peitl TSlivovsky FSzeider S(2019)Dependency learning for QBFJournal of Artificial Intelligence Research10.1613/jair.1.1152965:1(181-208)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1613/jair.1.11529
Show More Cited By

Index Terms

Resolve and expand
1. Theory of computation
  1. Logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Shift-Resolve parsing: simple, unbounded lookahead, linear time
CIAA'06: Proceedings of the 11th international conference on Implementation and Application of Automata

This paper introduces a mechanism for combining unbounded lookahead exploration with linear time complexity in a deterministic parser. The idea is to use a resolve parsing action in place of the classical reduce. The construction of shift-resolve ...
On-the-fly resolve trace minimization
DAC '07: Proceedings of the 44th annual Design Automation Conference

The ability of modern SAT solvers to produce proofs of un-satisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve trace that captures information about the creation of all conflict ...
On stateless multihead automata: Hierarchies and the emptiness problem

We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

SAT'04: Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

May 2004

393 pages

ISBN:354027829X

Editors:
Holger H. Hoos
Department of Computer Science, University of British Columbia Vancouver, B.C., Canada
,
David G. Mitchell
Computational Logic Laboratory, Simon Fraser University, Burnaby, BC, Canada

Sponsors

Cornell University: Cornell University
Intelligent Information Systems Institute
SFU: Simon Fraser University
Intel: Intel
PIMS: The Pacific Institute for the Mathematical Sciences

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 10 May 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

78
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Seidl M(2023)Never Trust Your Solver: Certification for SAT and QBFIntelligent Computer Mathematics10.1007/978-3-031-42753-4_2(16-33)Online publication date: 4-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-42753-4_2
Schlaipfer MSlivovsky FWeissenbacher GZuleger FPulina LSeidl MChew LHeule MVallade VLe Frioux LBaarir SSopena JGanesh VKordon FFeng NBacchus FHickey RBacchus FMöhle SSebastiani RBiere AShaw AMeel KLorenz JWörz FAudemard GPaulevé LSimon LHeisinger MFleury MBiere ANabeshima HInoue KKochemazov SMull NPang SRazborov ABonet MLevy JVinyals MElffers JJohannsen JNordström JYolcu EWu XHeule MLarrosa JRollon ELi CFleming NVinyals MPitassi TGanesh VAgrawal DBhavishya Meel KSlivovsky FSzeider SBerg JBacchus FPoole AFilmus YMahajan MSood GVinyals Mde Colnet ALe Berre DMarquis PWallon RMencía CMarques-Silva JHecher MThier PWoltran SSeed TKing AEvans NJonáš MStrejček JBeyersdorff OBlinkhorn JPeitl TShukla ASlivovsky FSzeider SSchlaipfer MSlivovsky FWeissenbacher GZuleger FMayer-Eichberger VSaffidine AAnderson MJi ZXu AČeška MMatyáš JMrazek VVojnar TEhlers RTreutler KWesling VJanota MMorgado AKarpiński MPiotrów M(2020)Multi-linear Strategy Extraction for QBF Expansion Proofs via Local SoundnessTheory and Applications of Satisfiability Testing – SAT 202010.1007/978-3-030-51825-7_30(429-446)Online publication date: 3-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-51825-7_30
Peitl TSlivovsky FSzeider S(2019)Dependency learning for QBFJournal of Artificial Intelligence Research10.1613/jair.1.1152965:1(181-208)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1613/jair.1.11529
Scholl CWimmer R(2018)Dependency Quantified Boolean Formulas: An Overview of Solution Methods and ApplicationsTheory and Applications of Satisfiability Testing – SAT 201810.1007/978-3-319-94144-8_1(3-16)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1007/978-3-319-94144-8_1
Heule MSeidl MBiere A(2017)Solution Validation and Extraction for QBF PreprocessingJournal of Automated Reasoning10.1007/s10817-016-9390-458:1(97-125)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1007/s10817-016-9390-4
Egly UKronegger MLonsing FPfandler A(2017)Conformant planning as a case study of incremental QBF solvingAnnals of Mathematics and Artificial Intelligence10.1007/s10472-016-9501-280:1(21-45)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s10472-016-9501-2
Wimmer RReimer SMarin PBecker B(2017)HQSpre --- An Effective Preprocessor for QBF and DQBFProceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 1020510.1007/978-3-662-54577-5_21(373-390)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54577-5_21
Rabe MTentrup LKaivola RWahl T(2015)CAQEProceedings of the 15th Conference on Formal Methods in Computer-Aided Design10.5555/2893529.2893554(136-143)Online publication date: 27-Sep-2015
https://dl.acm.org/doi/10.5555/2893529.2893554
Janota MMarques-Silva J(2015)Solving QBF by clause selectionProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832249.2832294(325-331)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832249.2832294
Miller CMarin PBecker B(2015)Verification of partial designs using incremental QBFAI Communications10.5555/2733572.273358028:2(283-307)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.5555/2733572.2733580
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents