Hints revealed

Jonathan Kalechstain; Vadim Ryvchin; Nachum Dershowitz

doi:10.1007/978-3-319-24318-4_7

Hints revealed

Jonathan Kalechstain^*, Vadim Ryvchin, Nachum Dershowitz

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We propose a notion of hints, clauses that are not necessarily consistent with the input formula. The goal of adding hints is to speed up the SAT solving process. For this purpose, we provide an efficient general mechanism for hint addition and removal. When a hint is determined to be inconsistent, a hint-based partial resolution-graph of an unsatisfiable core is used to reduce the search space. The suggested mechanism is used to boost performance by adding generated hints to the input formula. We describe two specific hint-suggestion methods, one of which increases performance by 30% on satisfiable SAT’13 competition instances and solves 9 instances not solved by the baseline solver.

Original language	English
Title of host publication	Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings
Editors	Marijn Heule, Sean Weaver
Publisher	Springer Verlag
Pages	71-87
Number of pages	17
ISBN (Print)	9783319243177
DOIs	https://doi.org/10.1007/978-3-319-24318-4_7
State	Published - 2015
Event	18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015 - Austin, United States Duration: 24 Sep 2015 → 27 Sep 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9340
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015
Country/Territory	United States
City	Austin
Period	24/09/15 → 27/09/15

Access to Document

10.1007/978-3-319-24318-4_7

Cite this

Kalechstain, J., Ryvchin, V., & Dershowitz, N. (2015). Hints revealed. In M. Heule, & S. Weaver (Eds.), Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings (pp. 71-87). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9340). Springer Verlag. https://doi.org/10.1007/978-3-319-24318-4_7

Kalechstain, Jonathan ; Ryvchin, Vadim ; Dershowitz, Nachum. / Hints revealed. Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. editor / Marijn Heule ; Sean Weaver. Springer Verlag, 2015. pp. 71-87 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b932475ddcb64b10872e25bad1e97f9e,

title = "Hints revealed",

abstract = "We propose a notion of hints, clauses that are not necessarily consistent with the input formula. The goal of adding hints is to speed up the SAT solving process. For this purpose, we provide an efficient general mechanism for hint addition and removal. When a hint is determined to be inconsistent, a hint-based partial resolution-graph of an unsatisfiable core is used to reduce the search space. The suggested mechanism is used to boost performance by adding generated hints to the input formula. We describe two specific hint-suggestion methods, one of which increases performance by 30% on satisfiable SAT{\textquoteright}13 competition instances and solves 9 instances not solved by the baseline solver.",

author = "Jonathan Kalechstain and Vadim Ryvchin and Nachum Dershowitz",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015 ; Conference date: 24-09-2015 Through 27-09-2015",

year = "2015",

doi = "10.1007/978-3-319-24318-4_7",

language = "אנגלית",

isbn = "9783319243177",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "71--87",

editor = "Marijn Heule and Sean Weaver",

booktitle = "Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings",

}

Kalechstain, J, Ryvchin, V & Dershowitz, N 2015, Hints revealed. in M Heule & S Weaver (eds), Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9340, Springer Verlag, pp. 71-87, 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, Austin, United States, 24/09/15. https://doi.org/10.1007/978-3-319-24318-4_7

Hints revealed. / Kalechstain, Jonathan; Ryvchin, Vadim; Dershowitz, Nachum.
Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. ed. / Marijn Heule; Sean Weaver. Springer Verlag, 2015. p. 71-87 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9340).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Hints revealed

AU - Kalechstain, Jonathan

AU - Ryvchin, Vadim

AU - Dershowitz, Nachum

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - We propose a notion of hints, clauses that are not necessarily consistent with the input formula. The goal of adding hints is to speed up the SAT solving process. For this purpose, we provide an efficient general mechanism for hint addition and removal. When a hint is determined to be inconsistent, a hint-based partial resolution-graph of an unsatisfiable core is used to reduce the search space. The suggested mechanism is used to boost performance by adding generated hints to the input formula. We describe two specific hint-suggestion methods, one of which increases performance by 30% on satisfiable SAT’13 competition instances and solves 9 instances not solved by the baseline solver.

AB - We propose a notion of hints, clauses that are not necessarily consistent with the input formula. The goal of adding hints is to speed up the SAT solving process. For this purpose, we provide an efficient general mechanism for hint addition and removal. When a hint is determined to be inconsistent, a hint-based partial resolution-graph of an unsatisfiable core is used to reduce the search space. The suggested mechanism is used to boost performance by adding generated hints to the input formula. We describe two specific hint-suggestion methods, one of which increases performance by 30% on satisfiable SAT’13 competition instances and solves 9 instances not solved by the baseline solver.

UR - http://www.scopus.com/inward/record.url?scp=84951105670&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-24318-4_7

DO - 10.1007/978-3-319-24318-4_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84951105670

SN - 9783319243177

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 71

EP - 87

BT - Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings

A2 - Heule, Marijn

A2 - Weaver, Sean

PB - Springer Verlag

T2 - 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015

Y2 - 24 September 2015 through 27 September 2015

ER -

Kalechstain J, Ryvchin V, Dershowitz N. Hints revealed. In Heule M, Weaver S, editors, Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. Springer Verlag. 2015. p. 71-87. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-24318-4_7

Hints revealed

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this