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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642027765, 9783642027772

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Does Advice Help to Prove Propositional Tautologies?

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

10.1007/978-3-642-02777-2_8 ◽

2009 ◽

pp. 65-72 ◽

Cited By ~ 2

Author(s):

Olaf Beyersdorff ◽

Sebastian Müller

Download Full-text

Minimizing Learned Clauses

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

10.1007/978-3-642-02777-2_23 ◽

2009 ◽

pp. 237-243 ◽

Cited By ~ 27

Author(s):

Niklas Sörensson ◽

Armin Biere

Download Full-text

Algorithms for Weighted Boolean Optimization

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

10.1007/978-3-642-02777-2_45 ◽

2009 ◽

pp. 495-508 ◽

Cited By ~ 58

Author(s):

Vasco Manquinho ◽

Joao Marques-Silva ◽

Jordi Planes

Keyword(s):

Boolean Optimization

Download Full-text

c-sat: A Parallel SAT Solver for Clusters

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

10.1007/978-3-642-02777-2_47 ◽

2009 ◽

pp. 524-537 ◽

Cited By ~ 18

Author(s):

Kei Ohmura ◽

Kazunori Ueda

Keyword(s):

Sat Solver

Download Full-text

Problem-Sensitive Restart Heuristics for the DPLL Procedure

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

10.1007/978-3-642-02777-2_33 ◽

2009 ◽

pp. 356-362 ◽

Cited By ~ 4

Author(s):

Carsten Sinz ◽

Markus Iser

Keyword(s):

Dpll Procedure

Download Full-text

Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

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

10.1007/978-3-642-02777-2_29 ◽

2009 ◽

pp. 298-311 ◽

Cited By ~ 8

Author(s):

Jingchao Chen

Keyword(s):

Look Ahead ◽

Sat Solver

Download Full-text

Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability

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

10.1007/978-3-642-02777-2_25 ◽

2009 ◽

pp. 258-264 ◽

Cited By ~ 5

Author(s):

Anton Belov ◽

Zbigniew Stachniak

Keyword(s):

Variable Selection ◽

Local Search ◽

Selection Process ◽

Propositional Satisfiability ◽

Stochastic Local Search

Download Full-text

Finding Efficient Circuits Using SAT-Solvers

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

10.1007/978-3-642-02777-2_5 ◽

2009 ◽

pp. 32-44 ◽

Cited By ~ 18

Author(s):

Arist Kojevnikov ◽

Alexander S. Kulikov ◽

Grigory Yaroslavtsev

Keyword(s):

Sat Solvers

Download Full-text

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT

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

10.1007/978-3-642-02777-2_27 ◽

2009 ◽

pp. 276-283 ◽

Cited By ~ 2

Author(s):

Stefan Szeider

Keyword(s):

Local Search ◽

Parameterized Complexity ◽

Max Sat

Download Full-text

Extending SAT Solvers to Cryptographic Problems

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

10.1007/978-3-642-02777-2_24 ◽

2009 ◽

pp. 244-257 ◽

Cited By ~ 115

Author(s):

Mate Soos ◽

Karsten Nohl ◽

Claude Castelluccia

Keyword(s):

Sat Solvers

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Does Advice Help to Prove Propositional Tautologies?

Minimizing Learned Clauses

Algorithms for Weighted Boolean Optimization

c-sat: A Parallel SAT Solver for Clusters

Problem-Sensitive Restart Heuristics for the DPLL Procedure

Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability

Finding Efficient Circuits Using SAT-Solvers

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT

Extending SAT Solvers to Cryptographic Problems

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