HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors
Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

POS-18: Volume Information

Proceedings of Pragmatics of SAT 2015 and 2018

Editors: Daniel Le Berre and Matti Järvisalo
EPiC Series in Computing•Volume 59
10 articles•152 pages•Published: March 15, 2019

Papers

Evaluating CDCL Restart Schemes
Armin Biere and Andreas Fröhlich
1-17
Predicting SAT Solver Performance on Heterogeneous Hardware
Zack Newsham, Vijay Ganesh and Sebastian Fischmeister
18-33
Checking Unsatisfiability Proofs in Parallel
Norbert Manthey and Tobias Philipp
34-49
Applications of MaxSAT in Data Analysis
Jeremias Berg, Antti Hyttinen and Matti Järvisalo
50-64
Competitive Sorter-based Encoding of PB-Constraints into SAT
Michał Karpiński and Marek Piotrów
65-78
CryptoMiniSat Switches-Optimization for Solving Cryptographic Instances
Anastasia Leventi-Peetz, Oliver Zendel, Werner Lennartz and Kai Weber
79-93
Two flavors of DRAT
Adrian Rebola Pardo and Armin Biere
94-110
The Effect of Scrambling CNFs
Armin Biere and Marijn Heule
111-126
Tuning Parallel SAT Solvers
Thorsten Ehlers and Dirk Nowotka
127-143
A Problem Meta-Data Library for Research in SAT
Markus Iser and Carsten Sinz
144-152

Keyphrases

Automatic Algorithm Configuration, CNF, comparator network, competition, Constraints Solver, cryptographic CNF instances, DRAT proofs, evaluation, experiments, meta-data library, odd-even network, parallel processing, parameter optimization, portfolio solver, problem fingerprinting, proof checking, Pseudo-Boolean, SAT3, SAT solver, scrambling, selection network, Unsatisfiability proof generation.

Copyright © 2012-2025 easychair.org. All rights reserved.