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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642316111, 9783642316128

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Single-Solver Algorithms for 2QBF

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

10.1007/978-3-642-31612-8_48 ◽

2012 ◽

pp. 487-488 ◽

Cited By ~ 1

Author(s):

Sam Bayless ◽

Alan J. Hu

Download Full-text

CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers

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

10.1007/978-3-642-31612-8_36 ◽

2012 ◽

pp. 449-455

Author(s):

Stephan Kottler ◽

Christian Zielke ◽

Paul Seitz ◽

Michael Kaufmann

Keyword(s):

Conflict Analysis ◽

Sat Solvers

Download Full-text

SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox

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

10.1007/978-3-642-31612-8_35 ◽

2012 ◽

pp. 442-448 ◽

Cited By ~ 12

Author(s):

Florian Corzilius ◽

Ulrich Loup ◽

Sebastian Junges ◽

Erika Ábrahám

Download Full-text

Perfect Hashing and CNF Encodings of Cardinality Constraints

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

10.1007/978-3-642-31612-8_30 ◽

2012 ◽

pp. 397-409 ◽

Cited By ~ 7

Author(s):

Yael Ben-Haim ◽

Alexander Ivrii ◽

Oded Margalit ◽

Arie Matsliah

Keyword(s):

Cardinality Constraints ◽

Perfect Hashing

Download Full-text

Henkin Quantifiers and Boolean Formulae

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

10.1007/978-3-642-31612-8_11 ◽

2012 ◽

pp. 129-142 ◽

Cited By ~ 3

Author(s):

Valeriy Balabanov ◽

Hui-Ju Katherine Chiang ◽

Jie-Hong Roland Jiang

Keyword(s):

Henkin Quantifiers

Download Full-text

Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

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

10.1007/978-3-642-31612-8_3 ◽

2012 ◽

pp. 16-29 ◽

Cited By ~ 25

Author(s):

Adrian Balint ◽

Uwe Schöning

Keyword(s):

Local Search ◽

Probability Distributions ◽

Stochastic Local Search

Download Full-text

Off the Trail: Re-examining the CDCL Algorithm

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

10.1007/978-3-642-31612-8_4 ◽

2012 ◽

pp. 30-43 ◽

Cited By ~ 2

Author(s):

Alexandra Goultiaeva ◽

Fahiem Bacchus

Download Full-text

On Efficient Computation of Variable MUSes

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

10.1007/978-3-642-31612-8_23 ◽

2012 ◽

pp. 298-311 ◽

Cited By ~ 3

Author(s):

Anton Belov ◽

Alexander Ivrii ◽

Arie Matsliah ◽

Joao Marques-Silva

Keyword(s):

Efficient Computation

Download Full-text

Improvements to Core-Guided Binary Search for MaxSAT

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

10.1007/978-3-642-31612-8_22 ◽

2012 ◽

pp. 284-297 ◽

Cited By ~ 21

Author(s):

Antonio Morgado ◽

Federico Heras ◽

Joao Marques-Silva

Keyword(s):

Binary Search

Download Full-text

Using Term Rewriting to Solve Bit-Vector Arithmetic Problems

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

10.1007/978-3-642-31612-8_51 ◽

2012 ◽

pp. 493-495

Author(s):

Iago Abal ◽

Alcino Cunha ◽

Joe Hurd ◽

Jorge Sousa Pinto

Keyword(s):

Term Rewriting ◽

Bit Vector

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Single-Solver Algorithms for 2QBF

CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers

SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox

Perfect Hashing and CNF Encodings of Cardinality Constraints

Henkin Quantifiers and Boolean Formulae

Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

Off the Trail: Re-examining the CDCL Algorithm

On Efficient Computation of Variable MUSes

Improvements to Core-Guided Binary Search for MaxSAT

Using Term Rewriting to Solve Bit-Vector Arithmetic Problems

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