| Publication | Date of Publication | Type |
|---|
| Circuits, proofs and propositional model counting | 2026-06-12 | Paper |
| Relating existing powerful proof systems for QBF | 2024-07-12 | Paper |
| Towards uniform certification in QBF | 2024-04-23 | Paper |
Towards Uniform Certification in QBF
Logical Methods in Computer Science | 2024-03-11 | Paper |
| How QBF expansion makes strategy extraction hard | 2022-11-09 | Paper |
| Hardness and optimality in QBF proof systems modulo NP | 2022-03-22 | Paper |
| Sorting parity encodings by reusing variables | 2021-04-07 | Paper |
| Avoiding Monochromatic Rectangles Using Shift Patterns | 2020-12-23 | Paper |
Frege systems for quantified Boolean logic
Journal of the ACM | 2020-11-11 | Paper |
| Short proofs in QBF expansion | 2020-05-20 | Paper |
| The equivalences of refutational QRAT | 2020-05-20 | Paper |
New resolution-based QBF calculi and their proof complexity
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
Journal of Automated Reasoning | 2019-09-02 | Paper |
A game characterisation of tree-like Q-resolution size
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Understanding cutting planes for QBFs
Information and Computation | 2018-09-27 | Paper |
| Understanding cutting planes for QBFs | 2018-04-19 | Paper |
Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
| Are Short Proofs Narrow? QBF Resolution is not Simple. | 2018-01-24 | Paper |
| Feasible interpolation for QBF resolution calculi | 2017-06-22 | Paper |
| Proof complexity of resolution-based QBF calculi | 2017-01-24 | Paper |
Lifting QBF resolution calculi to DQBF
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Lifting QBF resolution calculi to DQBF
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
A game characterisation of tree-like Q-resolution size
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Feasible interpolation for QBF resolution calculi
Automata, Languages, and Programming | 2015-10-27 | Paper |
On Unification of QBF Resolution-Based Calculi
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The complexity of theorem proving in circumscription and minimal entailment
Automated Reasoning | 2014-09-26 | Paper |
