Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030518240, 9783030518257

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Weakening Strategies for PB Solvers

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_23 ◽

2020 ◽

pp. 322-331

Author(s):

Daniel Le Berre ◽

Pierre Marquis ◽

Romain Wallon

Download Full-text

Sorting Parity Encodings by Reusing Variables

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_1 ◽

2020 ◽

pp. 1-10

Author(s):

Leroy Chew ◽

Marijn J. H. Heule

Download Full-text

Four Flavors of Entailment

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_5 ◽

2020 ◽

pp. 62-71

Author(s):

Sibylle Möhle ◽

Roberto Sebastiani ◽

Armin Biere

Download Full-text

Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_16 ◽

2020 ◽

pp. 218-232 ◽

Cited By ~ 1

Author(s):

Javier Larrosa ◽

Emma Rollon

Keyword(s):

Proof Systems

Download Full-text

A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_22 ◽

2020 ◽

pp. 312-321

Author(s):

Alexis de Colnet

Keyword(s):

Lower Bound

Download Full-text

Mycielski Graphs and PR Proofs

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_15 ◽

2020 ◽

pp. 201-217

Author(s):

Emre Yolcu ◽

Xinyu Wu ◽

Marijn J. H. Heule

Download Full-text

On CDCL-Based Proof Systems with the Ordered Decision Strategy

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_12 ◽

2020 ◽

pp. 149-165 ◽

Cited By ~ 1

Author(s):

Nathan Mull ◽

Shuo Pang ◽

Alexander Razborov

Keyword(s):

Decision Strategy ◽

Proof Systems

Download Full-text

Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_27 ◽

2020 ◽

pp. 378-393

Author(s):

Martin Jonáš ◽

Jan Strejček

Keyword(s):

Smt Solvers ◽

Bit Vector

Download Full-text

Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_36 ◽

2020 ◽

pp. 519-535

Author(s):

Michał Karpiński ◽

Marek Piotrów

Keyword(s):

Goal Functions

Download Full-text

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science ◽

10.1007/978-3-030-51825-7_30 ◽

2020 ◽

pp. 429-446

Author(s):

Matthias Schlaipfer ◽

Friedrich Slivovsky ◽

Georg Weissenbacher ◽

Florian Zuleger

Download Full-text

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

On Weakening Strategies for PB Solvers

Sorting Parity Encodings by Reusing Variables

Four Flavors of Entailment

Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems

A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints

Mycielski Graphs and PR Proofs

On CDCL-Based Proof Systems with the Ordered Decision Strategy

Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions

Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness

Theory and Applications of Satisfiability Testing – SAT 2020 - Lecture Notes in Computer Science
Latest Publications