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

TOTAL DOCUMENTS

28

(FIVE YEARS 28)

H-INDEX

3

(FIVE YEARS 3)

Published By Springer International Publishing

9783030242572, 9783030242589

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Assessing Heuristic Machine Learning Explanations with Model Counting

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

10.1007/978-3-030-24258-9_19 ◽

2019 ◽

pp. 267-278 ◽

Author(s):

Nina Narodytska ◽

Aditya Shrotri ◽

Kuldeep S. Meel ◽

Alexey Ignatiev ◽

Joao Marques-Silva

Keyword(s):

Machine Learning ◽

Download Full-text

$$\mathsf {CrystalBall}$$ : Gazing in the Black Box of SAT Solving

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

10.1007/978-3-030-24258-9_26 ◽

2019 ◽

pp. 371-387

Author(s):

Mate Soos ◽

Raghav Kulkarni ◽

Kuldeep S. Meel

Keyword(s):

Black Box ◽

Download Full-text

Knowledge Compilation Languages as Proof Systems

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

10.1007/978-3-030-24258-9_6 ◽

2019 ◽

pp. 90-99

Author(s):

Florent Capelli

Keyword(s):

Knowledge Compilation ◽

Download Full-text

Guiding High-Performance SAT Solvers with Unsat-Core Predictions

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

10.1007/978-3-030-24258-9_24 ◽

2019 ◽

pp. 336-353 ◽

Author(s):

Daniel Selsam ◽

Nikolaj Bjørner

Keyword(s):

High Performance ◽

Download Full-text

The Equivalences of Refutational QRAT

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

10.1007/978-3-030-24258-9_7 ◽

2019 ◽

pp. 100-116

Author(s):

Leroy Chew ◽

Judith Clymo

Download Full-text

Revisiting Graph Width Measures for CNF-Encodings

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

10.1007/978-3-030-24258-9_16 ◽

2019 ◽

pp. 222-238 ◽

Author(s):

Stefan Mengel ◽

Romain Wallon

Download Full-text

On Super Strong ETH

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

10.1007/978-3-030-24258-9_28 ◽

2019 ◽

pp. 406-423

Author(s):

Nikhil Vyas ◽

Ryan Williams

Download Full-text

Simplifying CDCL Clause Database Reduction

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

10.1007/978-3-030-24258-9_12 ◽

2019 ◽

pp. 183-192 ◽

Author(s):

Sima Jamali ◽

David Mitchell

Download Full-text

Syntax-Guided Rewrite Rule Enumeration for SMT Solvers

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

10.1007/978-3-030-24258-9_20 ◽

2019 ◽

pp. 279-297 ◽

Author(s):

Andres Nötzli ◽

Andrew Reynolds ◽

Haniel Barbosa ◽

Aina Niemetz ◽

Mathias Preiner ◽

...

Keyword(s):

Download Full-text

Short Proofs in QBF Expansion

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

10.1007/978-3-030-24258-9_2 ◽

2019 ◽

pp. 19-35 ◽

Author(s):

Olaf Beyersdorff ◽

Leroy Chew ◽

Judith Clymo ◽

Meena Mahajan

Download Full-text