Benjamin Kiesl

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Migrating solver state	2024-07-12	Paper
Encoding Redundancy for Satisfaction-Driven Clause Learning Tools and Algorithms for the Construction and Analysis of Systems	2023-11-24	Paper
Simulating strong practical proof systems with extended resolution Journal of Automated Reasoning	2020-11-02	Paper
Truth assignments as conditional autarkies Automated Technology for Verification and Analysis	2020-07-20	Paper
QRAT polynomially simulates \(\forall\)-Exp+Res	2020-05-20	Paper
Strong extension-free proof systems Journal of Automated Reasoning	2020-03-03	Paper
On structural analysis of non-ground answer-set programs	2019-04-24	Paper
Blocked clauses in first-order logic EPiC Series in Computing	2019-01-10	Paper
Local redundancy in SAT: generalizations of blocked clauses (available as arXiv preprint)	2018-11-02	Paper
Extended resolution simulates \({\mathsf{DRAT}}\)	2018-10-18	Paper
A little blocked literal goes a long way	2017-11-15	Paper
A unifying principle for clause elimination in first-order logic	2017-09-22	Paper
Short proofs without new variables	2017-09-22	Paper
Super-blocked clauses Automated Reasoning	2016-09-05	Paper

Research outcomes over time

This page was built for person: Benjamin Kiesl