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

TOTAL DOCUMENTS

37

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642141850, 9783642141867

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN

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

10.1007/978-3-642-14186-7_7 ◽

2010 ◽

pp. 58-70 ◽

Author(s):

Uwe Bubeck ◽

Hans Kleine Büning

Download Full-text

Two Techniques for Minimizing Resolution Proofs

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

10.1007/978-3-642-14186-7_26 ◽

2010 ◽

pp. 306-312 ◽

Author(s):

Scott Cotton

Keyword(s):

Resolution Proofs

Download Full-text

The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference

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

10.1007/978-3-642-14186-7_1 ◽

2010 ◽

pp. 1-7

Author(s):

Yehuda Naveh

Keyword(s):

Constraint Satisfaction ◽

Download Full-text

Green-Tao Numbers and SAT

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

10.1007/978-3-642-14186-7_32 ◽

2010 ◽

pp. 352-362 ◽

Author(s):

Oliver Kullmann

Download Full-text

Integrating Dependency Schemes in Search-Based QBF Solvers

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

10.1007/978-3-642-14186-7_14 ◽

2010 ◽

pp. 158-171 ◽

Author(s):

Florian Lonsing ◽

Armin Biere

Keyword(s):

Dependency Schemes

Download Full-text

Improving Unsatisfiability-Based Algorithms for Boolean Optimization

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

10.1007/978-3-642-14186-7_16 ◽

2010 ◽

pp. 181-193 ◽

Author(s):

Vasco Manquinho ◽

Ruben Martins ◽

Inês Lynce

Keyword(s):

Boolean Optimization

Download Full-text

Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold

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

10.1007/978-3-642-14186-7_10 ◽

2010 ◽

pp. 99-112 ◽

Author(s):

Yacine Boufkhad ◽

Thomas Hugel

Keyword(s):

Download Full-text

Exploiting Circuit Representations in QBF Solving

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

10.1007/978-3-642-14186-7_29 ◽

2010 ◽

pp. 333-339 ◽

Author(s):

Alexandra Goultiaeva ◽

Fahiem Bacchus

Download Full-text

Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas

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

10.1007/978-3-642-14186-7_4 ◽

2010 ◽

pp. 16-29 ◽

Author(s):

Eli Ben-Sasson ◽

Jan Johannsen

Keyword(s):

Lower Bounds ◽

Small Width ◽

Clause Learning

Download Full-text

The Seventh QBF Solvers Evaluation (QBFEVAL’10)

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

10.1007/978-3-642-14186-7_20 ◽

2010 ◽

pp. 237-250 ◽

Author(s):

Claudia Peschiera ◽

Luca Pulina ◽

Armando Tacchella ◽

Uwe Bubeck ◽

Oliver Kullmann ◽

...

Download Full-text