Mining backbone literals in incremental SAT a new kind of incremental data

Alexander Ivrii; Vadim Ryvchin; Ofer Strichman

doi:https://doi.org/10.1007/978-3-319-24318-4_8

Mining backbone literals in incremental SAT a new kind of incremental data

Alexander Ivrii, Vadim Ryvchin, Ofer Strichman

Data and Decision Sciences

Technion - Israel Institute of Technology

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

Abstract

In incremental SAT solving, information gained from previous similar instances has so far been limited to learned clauses that are still relevant, and heuristic information such as activity weights and scores. In most settings in which incremental satisfiability is applied, many of the instances along the sequence of formulas being solved are unsatisfiable. We show that in such cases, with a P-time analysis of the proof, we can compute a set of literals that are logically implied by the next instance. By adding those literals as assumptions, we accelerate the search.

Original language	English
Title of host publication	Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings
Editors	Marijn Heule, Sean Weaver
Pages	88-103
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-319-24318-4_8
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

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

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-319-24318-4_8

Cite this

Ivrii, A., Ryvchin, V., & Strichman, O. (2015). Mining backbone literals in incremental SAT a new kind of incremental data. In M. Heule, & S. Weaver (Eds.), Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings (pp. 88-103). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9340). https://doi.org/10.1007/978-3-319-24318-4_8

Ivrii, Alexander ; Ryvchin, Vadim ; Strichman, Ofer. / Mining backbone literals in incremental SAT a new kind of incremental data. Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. editor / Marijn Heule ; Sean Weaver. 2015. pp. 88-103 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{df5ed8d8ca104fe687d3ec30bc3c9a65,

title = "Mining backbone literals in incremental SAT a new kind of incremental data",

abstract = "In incremental SAT solving, information gained from previous similar instances has so far been limited to learned clauses that are still relevant, and heuristic information such as activity weights and scores. In most settings in which incremental satisfiability is applied, many of the instances along the sequence of formulas being solved are unsatisfiable. We show that in such cases, with a P-time analysis of the proof, we can compute a set of literals that are logically implied by the next instance. By adding those literals as assumptions, we accelerate the search.",

author = "Alexander Ivrii and Vadim Ryvchin and Ofer Strichman",

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 = "https://doi.org/10.1007/978-3-319-24318-4_8",

language = "الإنجليزيّة",

isbn = "9783319243177",

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

pages = "88--103",

editor = "Marijn Heule and Sean Weaver",

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

}

Ivrii, A, Ryvchin, V & Strichman, O 2015, Mining backbone literals in incremental SAT a new kind of incremental data. 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, pp. 88-103, 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_8

Mining backbone literals in incremental SAT a new kind of incremental data. / Ivrii, Alexander; Ryvchin, Vadim; Strichman, Ofer.
Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. ed. / Marijn Heule; Sean Weaver. 2015. p. 88-103 (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 - Mining backbone literals in incremental SAT a new kind of incremental data

AU - Ivrii, Alexander

AU - Ryvchin, Vadim

AU - Strichman, Ofer

PY - 2015

Y1 - 2015

N2 - In incremental SAT solving, information gained from previous similar instances has so far been limited to learned clauses that are still relevant, and heuristic information such as activity weights and scores. In most settings in which incremental satisfiability is applied, many of the instances along the sequence of formulas being solved are unsatisfiable. We show that in such cases, with a P-time analysis of the proof, we can compute a set of literals that are logically implied by the next instance. By adding those literals as assumptions, we accelerate the search.

AB - In incremental SAT solving, information gained from previous similar instances has so far been limited to learned clauses that are still relevant, and heuristic information such as activity weights and scores. In most settings in which incremental satisfiability is applied, many of the instances along the sequence of formulas being solved are unsatisfiable. We show that in such cases, with a P-time analysis of the proof, we can compute a set of literals that are logically implied by the next instance. By adding those literals as assumptions, we accelerate the search.

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

U2 - https://doi.org/10.1007/978-3-319-24318-4_8

DO - https://doi.org/10.1007/978-3-319-24318-4_8

M3 - منشور من مؤتمر

SN - 9783319243177

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

SP - 88

EP - 103

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

A2 - Heule, Marijn

A2 - Weaver, Sean

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

Y2 - 24 September 2015 through 27 September 2015

ER -

Ivrii A, Ryvchin V, Strichman O. Mining backbone literals in incremental SAT a new kind of incremental data. In Heule M, Weaver S, editors, Theory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings. 2015. p. 88-103. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-319-24318-4_8

Mining backbone literals in incremental SAT a new kind of incremental data

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this