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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030242572, 9783030242589

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Cited By ~ 1

Author(s):

Stefan Mengel ◽

Romain Wallon

Download Full-text

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 ◽

Cited By ~ 1

Author(s):

Nina Narodytska ◽

Aditya Shrotri ◽

Kuldeep S. Meel ◽

Alexey Ignatiev ◽

Joao Marques-Silva

Keyword(s):

Machine Learning ◽

Model Counting

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 ◽

Sat Solving

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 ◽

Proof Systems

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 ◽

Cited By ~ 3

Author(s):

Daniel Selsam ◽

Nikolaj Bjørner

Keyword(s):

High Performance ◽

Sat Solvers

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 ◽

Cited By ~ 1

Author(s):

Sima Jamali ◽

David Mitchell

Download Full-text

Combining Resolution-Path Dependencies with Dependency Learning

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

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

2019 ◽

pp. 306-318 ◽

Cited By ~ 1

Author(s):

Tomáš Peitl ◽

Friedrich Slivovsky ◽

Stefan Szeider

Keyword(s):

Path Dependencies

Download Full-text

A SAT-Based System for Consistent Query Answering

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

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

2019 ◽

pp. 117-135

Author(s):

Akhil A. Dixit ◽

Phokion G. Kolaitis

Keyword(s):

Query Answering ◽

Consistent Query Answering

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

The Equivalences of Refutational QRAT

Revisiting Graph Width Measures for CNF-Encodings

Assessing Heuristic Machine Learning Explanations with Model Counting

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

Knowledge Compilation Languages as Proof Systems

Guiding High-Performance SAT Solvers with Unsat-Core Predictions

On Super Strong ETH

Simplifying CDCL Clause Database Reduction

Combining Resolution-Path Dependencies with Dependency Learning

A SAT-Based System for Consistent Query Answering

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