EasyChair Smart SlideDocs/Log in
Author: Armin Biere

This page shows all presentations of this author published in EasyChair Smart Slide.

Certifying Incremental SAT Solving

Certifying Incremental SAT Solving

Katalin Fazekas, Florian Pollitt, Mathias Fleury and Armin Biere

CadiBack: Extracting Backbones with CaDiCaL

CadiBack: Extracting Backbones with CaDiCaL

Armin Biere, Nils Froleyks and Wenxi Wang

Faster LRAT Checking than Solving with CaDiCaL

Faster LRAT Checking than Solving with CaDiCaL

Florian Pollitt, Mathias Fleury and Armin Biere

QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers

QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers

Maximilian Heisinger, Martina Seidl and Armin Biere

Migrating Solver State

Migrating Solver State

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

Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul Through Sharing Instead of Copying Clauses

Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul Through Sharing Instead of Copying Clauses

Mathias Fleury and Armin Biere

Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification

Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification

Daniela Kaufmann, Paul Beame, Armin Biere and Jakob Nordstrom

The Effect of Scrambling CNFs

The Effect of Scrambling CNFs

Armin Biere and Marijn Heule

Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories

Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories

Katalin Fazekas, Fahiem Bacchus and Armin Biere

BTOR2, BtorMC and Boolector 3.0

BTOR2, BtorMC and Boolector 3.0

Aina Niemetz, Mathias Preiner, Clifford Wolf and Armin Biere

RP: A Practical Polynomial Calculus for Arithmetic Circuit Verification

RP: A Practical Polynomial Calculus for Arithmetic Circuit Verification

Daniela Ritirc, Armin Biere and Manuel Kauers

Presentations in this collection: 11
Copyright © 2002 – 2025 EasyChair