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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319092836, 9783319092843

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lazy Clause Exchange Policy for Parallel SAT Solvers

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

10.1007/978-3-319-09284-3_15 ◽

2014 ◽

pp. 197-205 ◽

Cited By ~ 29

Author(s):

Gilles Audemard ◽

Laurent Simon

Keyword(s):

Sat Solvers ◽

Exchange Policy

Download Full-text

Automatic Evaluation of Reductions between NP-Complete Problems

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

10.1007/978-3-319-09284-3_30 ◽

2014 ◽

pp. 415-421

Author(s):

Carles Creus ◽

Pau Fernández ◽

Guillem Godoy

Keyword(s):

Automatic Evaluation ◽

Complete Problems ◽

Np Complete

Download Full-text

Conditional Lower Bounds for Failed Literals and Related Techniques

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

10.1007/978-3-319-09284-3_7 ◽

2014 ◽

pp. 75-84

Author(s):

Matti Järvisalo ◽

Janne H. Korhonen

Keyword(s):

Lower Bounds

Download Full-text

Open-WBO: A Modular MaxSAT Solver,

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

10.1007/978-3-319-09284-3_33 ◽

2014 ◽

pp. 438-445 ◽

Cited By ~ 44

Author(s):

Ruben Martins ◽

Vasco Manquinho ◽

Inês Lynce

Download Full-text

A SAT Attack on the Erdős Discrepancy Conjecture

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

10.1007/978-3-319-09284-3_17 ◽

2014 ◽

pp. 219-226 ◽

Cited By ~ 22

Author(s):

Boris Konev ◽

Alexei Lisitsa

Download Full-text

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction

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

10.1007/978-3-319-09284-3_4 ◽

2014 ◽

pp. 32-47 ◽

Cited By ~ 2

Author(s):

Takayuki Sakai ◽

Kazuhisa Seto ◽

Suguru Tamaki

Keyword(s):

Max Sat ◽

Width Reduction

Download Full-text

Approximating Highly Satisfiable Random 2-SAT

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

10.1007/978-3-319-09284-3_28 ◽

2014 ◽

pp. 384-398

Author(s):

Andrei A. Bulatov ◽

Cong Wang

Download Full-text

Variable Dependencies and Q-Resolution

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

10.1007/978-3-319-09284-3_21 ◽

2014 ◽

pp. 269-284 ◽

Cited By ~ 9

Author(s):

Friedrich Slivovsky ◽

Stefan Szeider

Download Full-text

Cores in Core Based MaxSat Algorithms: An Analysis

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

10.1007/978-3-319-09284-3_2 ◽

2014 ◽

pp. 7-15 ◽

Cited By ~ 4

Author(s):

Fahiem Bacchus ◽

Nina Narodytska

Download Full-text

Solving MaxSAT and #SAT on Structured CNF Formulas

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

10.1007/978-3-319-09284-3_3 ◽

2014 ◽

pp. 16-31 ◽

Cited By ~ 3

Author(s):

Sigve Hortemo Sæther ◽

Jan Arne Telle ◽

Martin Vatshelle

Keyword(s):

Cnf Formulas

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Lazy Clause Exchange Policy for Parallel SAT Solvers

Automatic Evaluation of Reductions between NP-Complete Problems

Conditional Lower Bounds for Failed Literals and Related Techniques

Open-WBO: A Modular MaxSAT Solver,

A SAT Attack on the Erdős Discrepancy Conjecture

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction

Approximating Highly Satisfiable Random 2-SAT

Variable Dependencies and Q-Resolution

Cores in Core Based MaxSat Algorithms: An Analysis

Solving MaxSAT and #SAT on Structured CNF Formulas

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