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

TOTAL DOCUMENTS

27

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer International Publishing

9783319941431, 9783319941448

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Circuit-Based Search Space Pruning in QBF

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

10.1007/978-3-319-94144-8_12 ◽

2018 ◽

pp. 187-198 ◽

Author(s):

Mikoláš Janota

Keyword(s):

Search Space ◽

Search Space Pruning

Download Full-text

Fast and Flexible Probabilistic Model Counting

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

10.1007/978-3-319-94144-8_10 ◽

2018 ◽

pp. 148-164 ◽

Author(s):

Dimitris Achlioptas ◽

Zayd Hammoudeh ◽

Panos Theodoropoulos

Keyword(s):

Probabilistic Model ◽

Download Full-text

Chronological Backtracking

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

10.1007/978-3-319-94144-8_7 ◽

2018 ◽

pp. 111-121 ◽

Author(s):

Alexander Nadel ◽

Vadim Ryvchin

Download Full-text

Local Soundness for QBF Calculi

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

10.1007/978-3-319-94144-8_14 ◽

2018 ◽

pp. 217-234 ◽

Author(s):

Martin Suda ◽

Bernhard Gleiss

Download Full-text

Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition

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

10.1007/978-3-319-94144-8_22 ◽

2018 ◽

pp. 365-382 ◽

Author(s):

Shubhani Gupta ◽

Aseem Saxena ◽

Anmol Mahajan ◽

Sorav Bansal

Keyword(s):

Equivalence Checking ◽

Program Equivalence ◽

Smt Solvers ◽

Download Full-text

Centrality-Based Improvements to CDCL Heuristics

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

10.1007/978-3-319-94144-8_8 ◽

2018 ◽

pp. 122-131 ◽

Author(s):

Sima Jamali ◽

David Mitchell

Download Full-text

Solving MaxSAT with Bit-Vector Optimization

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

10.1007/978-3-319-94144-8_4 ◽

2018 ◽

pp. 54-72 ◽

Author(s):

Alexander Nadel

Keyword(s):

Vector Optimization ◽

Download Full-text

Symmetries of Quantified Boolean Formulas

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

10.1007/978-3-319-94144-8_13 ◽

2018 ◽

pp. 199-216 ◽

Author(s):

Manuel Kauers ◽

Martina Seidl

Keyword(s):

Quantified Boolean Formulas ◽

Boolean Formulas

Download Full-text

Finding All Minimal Safe Inductive Sets

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

10.1007/978-3-319-94144-8_21 ◽

2018 ◽

pp. 346-362

Author(s):

Ryan Berryhill ◽

Alexander Ivrii ◽

Andreas Veneris

Download Full-text

Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT

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

10.1007/978-3-319-94144-8_17 ◽

2018 ◽

pp. 273-291 ◽

Author(s):

Tobias Friedrich ◽

Ralf Rothenberger

Download Full-text