Benjamin Kiesl-Reiter

According to our database, Benjamin Kiesl-Reiter authored at least 25 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Propositional Proof Skeletons.

Joseph E. Reeves, Benjamin Kiesl-Reiter, Marijn J. H. Heule

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers.

Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Proofs for Incremental SAT with Inprocessing.

Benjamin Kiesl-Reiter, Michael W. Whalen

Proceedings of the Formal Methods in Computer-Aided Design, 2023

Solving String Constraints Using SAT.

Kevin Lotz, Amit Goel, Bruno Dutertre, Benjamin Kiesl-Reiter, Soonho Kong, Rupak Majumdar, Dirk Nowotka

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Migrating Solver State.

Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

2021

Preprocessing in SAT Solving.

Armin Biere, Matti Järvisalo, Benjamin Kiesl

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

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

Strong Extension-Free Proof Systems.

Marijn J. H. Heule, Benjamin Kiesl, Armin Biere

J. Autom. Reason., 2020

A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters.

Cas Cremers, Benjamin Kiesl, Niklas Medinger

Proceedings of the 29th USENIX Security Symposium, 2020

Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice.

Cas Cremers, Jaiden Fairoze, Benjamin Kiesl, Aurora Naska

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

Encoding Redundancy for Satisfaction-Driven Clause Learning.

Marijn J. H. Heule, Benjamin Kiesl, Armin Biere

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

QRAT Polynomially Simulates ∀ \text -Exp+Res.

Benjamin Kiesl, Martina Seidl

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Clausal Proofs of Mutilated Chessboards.

Marijn J. H. Heule, Benjamin Kiesl, Armin Biere

Proceedings of the NASA Formal Methods - 11th International Symposium, 2019

Truth Assignments as Conditional Autarkies.

Benjamin Kiesl, Marijn J. H. Heule, Armin Biere

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

Local Redundancy in SAT: Generalizations of Blocked Clauses.

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere

Log. Methods Comput. Sci., 2018

Extended Resolution Simulates DRAT.

Benjamin Kiesl, Adrián Rebola-Pardo, Marijn J. H. Heule

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017

A Little Blocked Literal Goes a Long Way.

Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Blocked Clauses in First-Order Logic.

Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere

Proceedings of the LPAR-21, 2017

Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

PRuning Through Satisfaction.

Marijn J. H. Heule, Benjamin Kiesl, Martina Seidl, Armin Biere

Proceedings of the Hardware and Software: Verification and Testing, 2017

A Unifying Principle for Clause Elimination in First-Order Logic.

Benjamin Kiesl, Martin Suda

Proceedings of the Automated Deduction - CADE 26, 2017

Short Proofs Without New Variables.

Marijn J. H. Heule, Benjamin Kiesl, Armin Biere

Proceedings of the Automated Deduction - CADE 26, 2017

The Potential of Interference-Based Proof Systems.

Marijn Heule, Benjamin Kiesl

Proceedings of the ARCADE 2017, 2017

2016

Super-Blocked Clauses.

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

On Structural Analysis of Non-Ground Answer-Set Programs.

Benjamin Kiesl, Peter Schüller, Hans Tompits

Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Cork, Ireland, August 31, 2015