Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

POS-14: Volume Information

POS-14. Fifth Pragmatics of SAT workshop

Editors: Daniel Le Berre

EPiC Series in Computing•Volume 27

9 articles•116 pages•Published: July 28, 2014

Papers

Dolius: A Distributed Parallel SAT Solving Framework

Gilles Audemard, Benoît Hoessen, Saïd Jabbour and Cédric Piette

1-11

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers

Marijn Heule, Norbert Manthey and Tobias Philipp

12-25

Post Mortem Analysis of SAT Solver Proofs

26-40

Formula partitioning revisited

Zoltan Mann and Pal Papp

41-56

New CNF Features and Formula Classification

Enrique Alfonso and Norbert Manthey

57-71

Typical-case complexity and the SAT competitions

72-87

Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling

88

Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers

Steffen Hölldobler, Norbert Manthey, Tobias Philipp and Peter Steinke

89-102

iDQ: Instantiation-Based DQBF Solving

Andreas Fröhlich, Gergely Kovásznai, Armin Biere and Helmut Veith

103-116

Keyphrases

abstraction, CDCL algorithm, clause sharing, CNF formulas, CNF partitioning, complexity analysis, distributed computing, Divide and Conquer, DQBF, DQDIMACS, EPR, feature extraction, Fiduccia-Mattheyses algorithm, Framework, hypergraph partitioning, Instantiation, machine learning, parallel satisfiability solver, QBF, SAT², SAT competitions, SAT partitioning, SAT platform, SAT proofs, SAT solvers, SAT solving³, transition system, typical-case complexity, unsatisfiability proof.