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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540208518, 9783540246053

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

kcnfs: An Efficient Solver for Random k-SAT Formulae

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

10.1007/978-3-540-24605-3_36 ◽

2004 ◽

pp. 486-501 ◽

Cited By ~ 11

Author(s):

Gilles Dequen ◽

Olivier Dubois

Keyword(s):

Efficient Solver

Download Full-text

Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution

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

10.1007/978-3-540-24605-3_31 ◽

2004 ◽

pp. 411-425 ◽

Cited By ~ 14

Author(s):

Maher Mneimneh ◽

Karem Sakallah

Keyword(s):

Large Graphs

Download Full-text

Watched Data Structures for QBF Solvers

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

10.1007/978-3-540-24605-3_3 ◽

2004 ◽

pp. 25-36 ◽

Cited By ~ 11

Author(s):

Ian Gent ◽

Enrico Giunchiglia ◽

Massimo Narizzano ◽

Andrew Rowley ◽

Armando Tacchella

Keyword(s):

Data Structures

Download Full-text

On Fixed-Parameter Tractable Parameterizations of SAT

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

10.1007/978-3-540-24605-3_15 ◽

2004 ◽

pp. 188-202 ◽

Cited By ~ 36

Author(s):

Stefan Szeider

Keyword(s):

Fixed Parameter Tractable ◽

Fixed Parameter

Download Full-text

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems

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

10.1007/978-3-540-24605-3_14 ◽

2004 ◽

pp. 172-187 ◽

Cited By ~ 3

Author(s):

Stefan Porschen ◽

Bert Randerath ◽

Ewald Speckenmeyer

Keyword(s):

Linear Time ◽

Satisfiability Problems ◽

Linear Time Algorithms

Download Full-text

On Computing k-CNF Formula Properties

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

10.1007/978-3-540-24605-3_25 ◽

2004 ◽

pp. 330-340 ◽

Cited By ~ 9

Author(s):

Ryan Williams

Download Full-text

On Boolean Models for Quantified Boolean Horn Formulas

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

10.1007/978-3-540-24605-3_8 ◽

2004 ◽

pp. 93-104 ◽

Cited By ~ 9

Author(s):

Hans Kleine Büning ◽

K. Subramani ◽

Xishun Zhao

Keyword(s):

Boolean Models ◽

Horn Formulas

Download Full-text

Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers

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

10.1007/978-3-540-24605-3_35 ◽

2004 ◽

pp. 468-485 ◽

Cited By ~ 15

Author(s):

Daniel Le Berre ◽

Laurent Simon ◽

Armando Tacchella

Download Full-text

The Interaction Between Inference and Branching Heuristics

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

10.1007/978-3-540-24605-3_28 ◽

2004 ◽

pp. 370-382

Author(s):

Lyndon Drake ◽

Alan Frisch

Download Full-text

Conflict-Based Selection of Branching Rules

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

10.1007/978-3-540-24605-3_33 ◽

2004 ◽

pp. 441-451 ◽

Cited By ~ 3

Author(s):

Marc Herbstritt ◽

Bernd Becker

Keyword(s):

Branching Rules ◽

Selection Of

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

kcnfs: An Efficient Solver for Random k-SAT Formulae

Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution

Watched Data Structures for QBF Solvers

On Fixed-Parameter Tractable Parameterizations of SAT

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems

On Computing k-CNF Formula Properties

On Boolean Models for Quantified Boolean Horn Formulas

Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers

The Interaction Between Inference and Branching Heuristics

Conflict-Based Selection of Branching Rules

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