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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319409696, 9783319409702

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Strong Backdoors for Default Logic

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

10.1007/978-3-319-40970-2_4 ◽

2016 ◽

pp. 45-59 ◽

Cited By ~ 4

Author(s):

Johannes K. Fichte ◽

Arne Meier ◽

Irina Schindler

Keyword(s):

Default Logic

Download Full-text

Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle

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

10.1007/978-3-319-40970-2_6 ◽

2016 ◽

pp. 77-84 ◽

Cited By ~ 1

Author(s):

Vsevolod Oparin

Keyword(s):

Upper Bound ◽

Pigeonhole Principle ◽

Linear Combinations

Download Full-text

Satisfiability via Smooth Pictures

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

10.1007/978-3-319-40970-2_2 ◽

2016 ◽

pp. 13-28

Author(s):

Mateus de Oliveira Oliveira

Download Full-text

Parameterized Compilation Lower Bounds for Restricted CNF-Formulas

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

10.1007/978-3-319-40970-2_1 ◽

2016 ◽

pp. 3-12 ◽

Cited By ~ 1

Author(s):

Stefan Mengel

Keyword(s):

Lower Bounds ◽

Cnf Formulas

Download Full-text

Long Distance Q-Resolution with Dependency Schemes

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

10.1007/978-3-319-40970-2_31 ◽

2016 ◽

pp. 500-518 ◽

Cited By ~ 9

Author(s):

Tomáš Peitl ◽

Friedrich Slivovsky ◽

Stefan Szeider

Keyword(s):

Long Distance ◽

Dependency Schemes

Download Full-text

LMHS: A SAT-IP Hybrid MaxSAT Solver

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

10.1007/978-3-319-40970-2_34 ◽

2016 ◽

pp. 539-546 ◽

Cited By ~ 17

Author(s):

Paul Saikko ◽

Jeremias Berg ◽

Matti Järvisalo

Download Full-text

The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$

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

10.1007/978-3-319-40970-2_5 ◽

2016 ◽

pp. 60-76

Author(s):

Daniel Berend ◽

Yochai Twitto

Keyword(s):

Autocorrelation Length

Download Full-text

Computing Maximum Unavoidable Subgraphs Using SAT Solvers

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

10.1007/978-3-319-40970-2_13 ◽

2016 ◽

pp. 196-211

Author(s):

C. K. Cuong ◽

M. J. H. Heule

Keyword(s):

Sat Solvers

Download Full-text

Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT

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

10.1007/978-3-319-40970-2_14 ◽

2016 ◽

pp. 212-227 ◽

Cited By ~ 2

Author(s):

Mathias Soeken ◽

Alan Mishchenko ◽

Ana Petkovska ◽

Baruch Sterin ◽

Paolo Ienne ◽

...

Download Full-text

MCS Extraction with Sublinear Oracle Queries

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

10.1007/978-3-319-40970-2_21 ◽

2016 ◽

pp. 342-360 ◽

Cited By ~ 7

Author(s):

Carlos Mencía ◽

Alexey Ignatiev ◽

Alessandro Previti ◽

Joao Marques-Silva

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Strong Backdoors for Default Logic

Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle

Satisfiability via Smooth Pictures

Parameterized Compilation Lower Bounds for Restricted CNF-Formulas

Long Distance Q-Resolution with Dependency Schemes

LMHS: A SAT-IP Hybrid MaxSAT Solver

The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$

Computing Maximum Unavoidable Subgraphs Using SAT Solvers

Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT

MCS Extraction with Sublinear Oracle Queries

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