On Structural Analysis of Non-Ground Answer-Set Programs. - Benjamin Kiesl; Peter Schüller; Hans Tompits (ICLP (Technical Communications), 2015)

Super-Blocked Clauses. - Benjamin Kiesl; Martina Seidl; Hans Tompits; Armin Biere (IJCAR, 2016)

The Potential of Interference-Based Proof Systems. - Marijn Heule; Benjamin Kiesl (ARCADE@CADE, 2017)

Short Proofs Without New Variables. - Marijn J. H. Heule; Benjamin Kiesl; Armin Biere (CADE, 2017)

A Unifying Principle for Clause Elimination in First-Order Logic. - Benjamin Kiesl; Martin Suda 001 (CADE, 2017)

PRuning Through Satisfaction. - Marijn J. H. Heule; Benjamin Kiesl; Martina Seidl; Armin Biere (Haifa Verification Conference, 2017)

Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? - Benjamin Kiesl; Martina Seidl; Hans Tompits; Armin Biere (IJCAI, 2017)

Blocked Clauses in First-Order Logic. - Benjamin Kiesl; Martin Suda 001; Martina Seidl; Hans Tompits; Armin Biere (LPAR, 2017)

A Little Blocked Literal Goes a Long Way. - Benjamin Kiesl; Marijn J. H. Heule; Martina Seidl (SAT, 2017)

Extended Resolution Simulates DRAT. - Benjamin Kiesl; Adrián Rebola-Pardo; Marijn J. H. Heule (IJCAR, 2018)

Local Redundancy in SAT: Generalizations of Blocked Clauses. - Benjamin Kiesl; Martina Seidl; Hans Tompits; Armin Biere (Log. Methods Comput. Sci., 2018)

Truth Assignments as Conditional Autarkies. - Benjamin Kiesl; Marijn J. H. Heule; Armin Biere (ATVA, 2019)

Clausal Proofs of Mutilated Chessboards. - Marijn J. H. Heule; Benjamin Kiesl; Armin Biere (NFM, 2019)

QRAT Polynomially Simulates ∀ text -Exp+Res. - Benjamin Kiesl; Martina Seidl (SAT, 2019)

Encoding Redundancy for Satisfaction-Driven Clause Learning. - Marijn J. H. Heule; Benjamin Kiesl; Armin Biere (TACAS (1), 2019)

Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice. - Cas Cremers; Jaiden Fairoze; Benjamin Kiesl; Aurora Naska (CCS, 2020)

A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters. - Cas Cremers; Benjamin Kiesl; Niklas Medinger (USENIX Security Symposium, 2020)

Strong Extension-Free Proof Systems. - Marijn J. H. Heule; Benjamin Kiesl; Armin Biere (J. Autom. Reason., 2020)

Simulating Strong Practical Proof Systems with Extended Resolution. - Benjamin Kiesl; Adrián Rebola-Pardo; Marijn J. H. Heule; Armin Biere (J. Autom. Reason., 2020)

Preprocessing in SAT Solving. - Armin Biere; Matti Järvisalo; Benjamin Kiesl (Handbook of Satisfiability, 2021)

Migrating Solver State. - Armin Biere; Md. Solimul Chowdhury; Marijn J. H. Heule; Benjamin Kiesl; Michael W. Whalen (SAT, 2022)

Solving String Constraints Using SAT. - Kevin Lotz; Amit Goel; Bruno Dutertre; Benjamin Kiesl-Reiter; Soonho Kong; Rupak Majumdar; Dirk Nowotka (CAV (2), 2023)

Proofs for Incremental SAT with Inprocessing. - Benjamin Kiesl-Reiter; Michael W. Whalen (FMCAD, 2023)

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. - Dawn Michaelson; Dominik Schreiber 001; Marijn J. H. Heule; Benjamin Kiesl-Reiter; Michael W. Whalen (TACAS (1), 2023)

Propositional Proof Skeletons. - Joseph E. Reeves; Benjamin Kiesl-Reiter; Marijn J. H. Heule (TACAS (1), 2023)

Solving String Constraints with Concatenation Using SAT. - Kevin Lotz; Amit Goel; Bruno Dutertre; Benjamin Kiesl-Reiter; Soonho Kong; Dirk Nowotka (FMCAD, 2024)

Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers. - Dawn Michaelson; Dominik Schreiber 001; Marijn J. H. Heule; Benjamin Kiesl-Reiter; Michael W. Whalen (J. Autom. Reason., 2025)