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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642215803, 9783642215810

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Empirical Study of the Anatomy of Modern Sat Solvers

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

10.1007/978-3-642-21581-0_27 ◽

2011 ◽

pp. 343-356 ◽

Cited By ~ 25

Author(s):

Hadi Katebi ◽

Karem A. Sakallah ◽

João P. Marques-Silva

Keyword(s):

Empirical Study ◽

Sat Solvers

Download Full-text

BDDs for Pseudo-Boolean Constraints – Revisited

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

10.1007/978-3-642-21581-0_7 ◽

2011 ◽

pp. 61-75 ◽

Cited By ~ 7

Author(s):

Ignasi Abío ◽

Robert Nieuwenhuis ◽

Albert Oliveras ◽

Enric Rodríguez-Carbonell

Download Full-text

Transformations into Normal Forms for Quantified Circuits

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

10.1007/978-3-642-21581-0_20 ◽

2011 ◽

pp. 245-258

Author(s):

Hans Kleine Büning ◽

Xishun Zhao ◽

Uwe Bubeck

Keyword(s):

Normal Forms

Download Full-text

Between Restarts and Backjumps

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

10.1007/978-3-642-21581-0_18 ◽

2011 ◽

pp. 216-229 ◽

Cited By ~ 7

Author(s):

Antonio Ramos ◽

Peter van der Tak ◽

Marijn J. H. Heule

Download Full-text

Model Counting Using the Inclusion-Exclusion Principle

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

10.1007/978-3-642-21581-0_30 ◽

2011 ◽

pp. 362-363 ◽

Cited By ~ 3

Author(s):

Huxley Bennett ◽

Sriram Sankaranarayanan

Keyword(s):

Exclusion Principle ◽

Model Counting

Download Full-text

Parameterized Complexity of DPLL Search Procedures

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

10.1007/978-3-642-21581-0_3 ◽

2011 ◽

pp. 5-18 ◽

Cited By ~ 3

Author(s):

Olaf Beyersdorff ◽

Nicola Galesi ◽

Massimo Lauria

Keyword(s):

Parameterized Complexity

Download Full-text

Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One

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

10.1007/978-3-642-21581-0_22 ◽

2011 ◽

pp. 273-286 ◽

Cited By ~ 5

Author(s):

Ignasi Abío ◽

Morgan Deters ◽

Robert Nieuwenhuis ◽

Peter J. Stuckey

Download Full-text

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs

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

10.1007/978-3-642-21581-0_12 ◽

2011 ◽

pp. 134-144 ◽

Cited By ~ 1

Author(s):

Ewald Speckenmeyer ◽

Andreas Wotzlaw ◽

Stefan Porschen

Download Full-text

Generalized Conflict-Clause Strengthening for Satisfiability Solvers

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

10.1007/978-3-642-21581-0_26 ◽

2011 ◽

pp. 329-342 ◽

Cited By ~ 6

Author(s):

Allen Van Gelder

Keyword(s):

Satisfiability Solvers

Download Full-text

On Freezing and Reactivating Learnt Clauses

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

10.1007/978-3-642-21581-0_16 ◽

2011 ◽

pp. 188-200 ◽

Cited By ~ 18

Author(s):

Gilles Audemard ◽

Jean-Marie Lagniez ◽

Bertrand Mazure ◽

Lakhdar Saïs

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Empirical Study of the Anatomy of Modern Sat Solvers

BDDs for Pseudo-Boolean Constraints – Revisited

Transformations into Normal Forms for Quantified Circuits

Between Restarts and Backjumps

Model Counting Using the Inclusion-Exclusion Principle

Parameterized Complexity of DPLL Search Procedures

Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs

Generalized Conflict-Clause Strengthening for Satisfiability Solvers

On Freezing and Reactivating Learnt Clauses

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