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

TOTAL DOCUMENTS

(FIVE YEARS 37)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030802226, 9783030802233

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Hardness and Optimality in QBF Proof Systems Modulo NP

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

10.1007/978-3-030-80223-3_8 ◽

2021 ◽

pp. 98-115

Author(s):

Leroy Chew

Keyword(s):

Proof Systems

Download Full-text

Scalable SAT Solving in the Cloud

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

10.1007/978-3-030-80223-3_35 ◽

2021 ◽

pp. 518-534

Author(s):

Dominik Schreiber ◽

Peter Sanders

Keyword(s):

Sat Solving

Download Full-text

PyDGGA: Distributed GGA for Automatic Configuration

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

10.1007/978-3-030-80223-3_2 ◽

2021 ◽

pp. 11-20

Author(s):

Carlos Ansótegui ◽

Josep Pon ◽

Meinolf Sellmann ◽

Kevin Tierney

Download Full-text

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

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

10.1007/978-3-030-80223-3_13 ◽

2021 ◽

pp. 188-206

Author(s):

Tobias Friedrich ◽

Frank Neumann ◽

Ralf Rothenberger ◽

Andrew M. Sutton

Download Full-text

On the Hierarchical Community Structure of Practical Boolean Formulas

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

10.1007/978-3-030-80223-3_25 ◽

2021 ◽

pp. 359-376

Author(s):

Chunxiao Li ◽

Jonathan Chung ◽

Soham Mukherjee ◽

Marc Vinyals ◽

Noah Fleming ◽

...

Keyword(s):

Community Structure ◽

Boolean Formulas

Download Full-text

SAT-Based Rigorous Explanations for Decision Lists

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

10.1007/978-3-030-80223-3_18 ◽

2021 ◽

pp. 251-269

Author(s):

Alexey Ignatiev ◽

Joao Marques-Silva

Keyword(s):

Decision Lists

Download Full-text

Lower Bounds for QCDCL via Formula Gauge

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

10.1007/978-3-030-80223-3_5 ◽

2021 ◽

pp. 47-63

Author(s):

Benjamin Böhm ◽

Olaf Beyersdorff

Keyword(s):

Lower Bounds

Download Full-text

Chinese Remainder Encoding for Hamiltonian Cycles

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

10.1007/978-3-030-80223-3_15 ◽

2021 ◽

pp. 216-224

Author(s):

Marijn J. H. Heule

Keyword(s):

Hamiltonian Cycles

Download Full-text

DiMo – Discrete Modelling Using Propositional Logic

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

10.1007/978-3-030-80223-3_17 ◽

2021 ◽

pp. 242-250

Author(s):

Norbert Hundeshagen ◽

Martin Lange ◽

Georg Siebert

Keyword(s):

Propositional Logic ◽

Discrete Modelling

Download Full-text

DQBDD: An Efficient BDD-Based DQBF Solver

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

10.1007/978-3-030-80223-3_36 ◽

2021 ◽

pp. 535-544

Author(s):

Juraj Síč ◽

Jan Strejček

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Hardness and Optimality in QBF Proof Systems Modulo NP

Scalable SAT Solving in the Cloud

PyDGGA: Distributed GGA for Automatic Configuration

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

On the Hierarchical Community Structure of Practical Boolean Formulas

SAT-Based Rigorous Explanations for Decision Lists

Lower Bounds for QCDCL via Formula Gauge

Chinese Remainder Encoding for Hamiltonian Cycles

DiMo – Discrete Modelling Using Propositional Logic

DQBDD: An Efficient BDD-Based DQBF Solver

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