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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540727873, 9783540727880

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Backdoor Sets of Quantified Boolean Formulas

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

10.1007/978-3-540-72788-0_23 ◽

2007 ◽

pp. 230-243 ◽

Cited By ~ 5

Author(s):

Marko Samer ◽

Stefan Szeider

Keyword(s):

Quantified Boolean Formulas ◽

Backdoor Sets ◽

Boolean Formulas

Download Full-text

Encodings of Problems in Effectively Propositional Logic

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

10.1007/978-3-540-72788-0_2 ◽

2007 ◽

pp. 3-3 ◽

Cited By ~ 2

Author(s):

Juan Antonio Navarro-Pérez ◽

Andrei Voronkov

Keyword(s):

Propositional Logic

Download Full-text

Fault Localization and Correction with QBF

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

10.1007/978-3-540-72788-0_34 ◽

2007 ◽

pp. 355-368 ◽

Cited By ~ 27

Author(s):

Stefan Staber ◽

Roderick Bloem

Keyword(s):

Fault Localization

Download Full-text

Efficient Circuit to CNF Conversion

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

10.1007/978-3-540-72788-0_3 ◽

2007 ◽

pp. 4-9 ◽

Cited By ~ 14

Author(s):

Panagiotis Manolios ◽

Daron Vroon

Download Full-text

On the Boolean Connectivity Problem for Horn Relations

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

10.1007/978-3-540-72788-0_20 ◽

2007 ◽

pp. 187-200 ◽

Cited By ~ 4

Author(s):

Kazuhisa Makino ◽

Suguru Tamaki ◽

Masaki Yamamoto

Keyword(s):

Connectivity Problem

Download Full-text

Matched Formulas and Backdoor Sets

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

10.1007/978-3-540-72788-0_12 ◽

2007 ◽

pp. 94-99 ◽

Cited By ~ 2

Author(s):

Stefan Szeider

Keyword(s):

Backdoor Sets

Download Full-text

A First Step Towards a Unified Proof Checker for QBF

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

10.1007/978-3-540-72788-0_21 ◽

2007 ◽

pp. 201-214 ◽

Cited By ~ 25

Author(s):

Toni Jussila ◽

Armin Biere ◽

Carsten Sinz ◽

Daniel Kröning ◽

Christoph M. Wintersteiger

Keyword(s):

Proof Checker

Download Full-text

Solving Multi-objective Pseudo-Boolean Problems

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

10.1007/978-3-540-72788-0_9 ◽

2007 ◽

pp. 56-69 ◽

Cited By ~ 4

Author(s):

Martin Lukasiewycz ◽

Michael Glaß ◽

Christian Haubelt ◽

Jürgen Teich

Keyword(s):

Multi Objective

Download Full-text

Partial Max-SAT Solvers with Clause Learning

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

10.1007/978-3-540-72788-0_7 ◽

2007 ◽

pp. 28-40 ◽

Cited By ~ 8

Author(s):

Josep Argelich ◽

Felip Manyà

Keyword(s):

Sat Solvers ◽

Clause Learning ◽

Max Sat

Download Full-text

Algorithms for Variable-Weighted 2-SAT and Dual Problems

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

10.1007/978-3-540-72788-0_19 ◽

2007 ◽

pp. 173-186 ◽

Cited By ~ 3

Author(s):

Stefan Porschen ◽

Ewald Speckenmeyer

Keyword(s):

Dual Problems

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Backdoor Sets of Quantified Boolean Formulas

Encodings of Problems in Effectively Propositional Logic

Fault Localization and Correction with QBF

Efficient Circuit to CNF Conversion

On the Boolean Connectivity Problem for Horn Relations

Matched Formulas and Backdoor Sets

A First Step Towards a Unified Proof Checker for QBF

Solving Multi-objective Pseudo-Boolean Problems

Partial Max-SAT Solvers with Clause Learning

Algorithms for Variable-Weighted 2-SAT and Dual Problems

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