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

TOTAL DOCUMENTS

34

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642390708, 9783642390715

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Snappy: A Simple Algorithm Portfolio

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

10.1007/978-3-642-39071-5_33 ◽

2013 ◽

pp. 422-428 ◽

Author(s):

Horst Samulowitz ◽

Chandra Reddy ◽

Ashish Sabharwal ◽

Meinolf Sellmann

Keyword(s):

Simple Algorithm ◽

Algorithm Portfolio

Download Full-text

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem

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

10.1007/978-3-642-39071-5_26 ◽

2013 ◽

pp. 351-364 ◽

Author(s):

Massimo Lauria

Keyword(s):

Lower Bound ◽

Cutting Planes ◽

Ramsey's Theorem ◽

Ramsey’S Theorem

Download Full-text

Nested Boolean Functions as Models for Quantified Boolean Formulas

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

10.1007/978-3-642-39071-5_20 ◽

2013 ◽

pp. 267-275 ◽

Author(s):

Uwe Bubeck ◽

Hans Kleine Büning

Keyword(s):

Boolean Functions ◽

Quantified Boolean Formulas ◽

Boolean Formulas

Download Full-text

Concurrent Clause Strengthening

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

10.1007/978-3-642-39071-5_10 ◽

2013 ◽

pp. 116-132 ◽

Author(s):

Siert Wieringa ◽

Keijo Heljanko

Download Full-text

Local Backbones

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

10.1007/978-3-642-39071-5_28 ◽

2013 ◽

pp. 377-393 ◽

Author(s):

Ronald de Haan ◽

Iyad Kanj ◽

Stefan Szeider

Download Full-text

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction

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

10.1007/978-3-642-39071-5_23 ◽

2013 ◽

pp. 309-317 ◽

Author(s):

Gilles Audemard ◽

Jean-Marie Lagniez ◽

Laurent Simon

Keyword(s):

Download Full-text

There Are No CNF Problems

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

10.1007/978-3-642-39071-5_3 ◽

2013 ◽

pp. 19-21 ◽

Author(s):

Peter J. Stuckey

Download Full-text

Upper and Lower Bounds for Weak Backdoor Set Detection

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

10.1007/978-3-642-39071-5_29 ◽

2013 ◽

pp. 394-402 ◽

Author(s):

Neeldhara Misra ◽

Sebastian Ordyniak ◽

Venkatesh Raman ◽

Stefan Szeider

Keyword(s):

Lower Bounds ◽

Upper And Lower Bounds

Download Full-text

Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation

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

10.1007/978-3-642-39071-5_9 ◽

2013 ◽

pp. 100-115 ◽

Author(s):

Florian Lonsing ◽

Uwe Egly ◽

Allen Van Gelder

Keyword(s):

Quantified Boolean Formulas ◽

Boolean Formulas ◽

Clause Learning ◽

Unit Propagation

Download Full-text

On Propositional QBF Expansions and Q-Resolution

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

10.1007/978-3-642-39071-5_7 ◽

2013 ◽

pp. 67-82 ◽

Author(s):

Mikoláš Janota ◽

Joao Marques-Silva

Download Full-text