EasyChair Smart SlideDocs/Log in
Conference: SAT-22 (25th International Conference on Theory and Practice of Satisfiability Testing)

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

MaxSAT-Based Bi-Objective Boolean Optimization

MaxSAT-Based Bi-Objective Boolean Optimization

Christoph Jabs, Jeremias Berg, Andreas Niskanen and Matti Järvisalo

A New Exact Solver for (Weighted) Max#SAT

A New Exact Solver for (Weighted) Max#SAT

Gilles Audemard, Jean Marie Lagniez and Marie Miceli

Towards Learning Quantifier Instantiation in SMT

Towards Learning Quantifier Instantiation in SMT

Mikolas Janota, Jelle Piepenbrock and Bartosz Piotrowski

Incremental Maximum Satisfiability

Incremental Maximum Satisfiability

Andreas Niskanen, Jeremias Berg and Matti Järvisalo

Migrating Solver State

Migrating Solver State

Armin Biere, Md Solimul Chowdhury, Marijn Heule, Benjamin Kiesl and Michael Whalen

Certified CNF Translations for Pseudo-Boolean Solving

Certified CNF Translations for Pseudo-Boolean Solving

Stephan Gocht, Ruben Martins, Jakob Nordström and Andy Oertel

The Packing Chromatic Number of the Infinite Square Grid Is at Least 14

The Packing Chromatic Number of the Infinite Square Grid Is at Least 14

Bernardo Subercaseaux and Marijn Heule

QBF Programming with the Modeling Language Bule

QBF Programming with the Modeling Language Bule

Jean Christoph Jung, Valentin Mayer-Eichberger and Abdallah Saffidine

A Comprehensive Study of K-Portfolios of Recent SAT Solvers

A Comprehensive Study of K-Portfolios of Recent SAT Solvers

Jakob Bach, Markus Iser and Klemens Böhm

Classes of Hard Formulas for QBF Resolution

Classes of Hard Formulas for QBF Resolution

Agnes Schleitzer and Olaf Beyersdorff

Presentations in this collection: 10
Copyright © 2002 – 2024 EasyChair