Conference: POS-18 (Pragmatics of SAT 2018)

Conference: POS-18 (Pragmatics of SAT 2018)

This page shows all presentations from this conference published in EasyChair Smart Slide.

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks

Jan Elffers, Jesus Giráldez-Cru, Stephan Gocht, Jakob Nordstrom and Laurent Simon

MLIC: A MaxSAT-Based framework for learning interpretable classification rules

MLIC: A MaxSAT-Based framework for learning interpretable classification rules

Dmitry Malioutov and Kuldeep S. Meel

Divide and Conquer: Towards Faster Pseudo-Boolean Solving

Divide and Conquer: Towards Faster Pseudo-Boolean Solving

Jan Elffers and Jakob Nordstrom

The Effect of Scrambling CNFs

The Effect of Scrambling CNFs

Armin Biere and Marijn Heule

On the use of solvers with docker technology

On the use of solvers with docker technology

Daniel Le Berre

Stedman and Erin Triples encoded as a SAT Problem

Stedman and Erin Triples encoded as a SAT Problem

Tuning Parallel SAT Solvers

Tuning Parallel SAT Solvers

Thorsten Ehlers and Dirk Nowotka

CryptoMiniSat Switches-Optimization for Solving Cryptographic Instances

CryptoMiniSat Switches-Optimization for Solving Cryptographic Instances

Anastasia Leventi-Peetz, Oliver Zendel, Werner Lennartz and Kai Weber

Competitive Sorter-based Encoding of PB-Constraints into SAT

Competitive Sorter-based Encoding of PB-Constraints into SAT

Michał Karpiński and Marek Piotrów

A Problem Meta-Data Library for Research in SAT

A Problem Meta-Data Library for Research in SAT

Markus Iser and Carsten Sinz

Presentations in this collection: 10