| Publication | Date of Publication | Type |
|---|
| Proof complexity of propositional model counting | 2024-11-26 | Paper |
| QCDCL vs QBF resolution: further insights | 2024-11-26 | Paper |
| Classes of hard formulas for QBF resolution | 2024-07-12 | Paper |
| Should decisions in QCDCL follow prefix order? | 2024-07-12 | Paper |
| Should Decisions in QCDCL Follow Prefix Order? | 2024-04-29 | Paper |
| Lower bounds for QCDCL via formula gauge | 2023-10-24 | Paper |
| Classes of hard formulas for QBF resolution | 2023-10-23 | Paper |
| Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution | 2023-08-26 | Paper |
| Proof Complexity of Quantified Boolean Logic — A Survey | 2023-08-04 | Paper |
| Hardness Characterisations and Size-width Lower Bounds for QBF Resolution | 2023-04-05 | Paper |
| Reasons for hardness in QBF proof systems | 2022-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090460 | 2022-07-18 | Paper |
| Proof complexity of modal resolution | 2022-03-25 | Paper |
| QBFFam: a tool for generating QBF families from proof complexity | 2022-03-22 | Paper |
| Lower bounds for QCDCL via formula gauge | 2022-03-22 | Paper |
| Size, cost and capacity: a semantic technique for hard random QBFs | 2021-06-15 | Paper |
| Building strategies into QBF proofs | 2021-06-09 | Paper |
| Strong (D)QBF dependency schemes via tautology-free resolution paths | 2021-04-07 | Paper |
| A simple proof of QBF hardness | 2021-03-11 | Paper |
| Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136303 | 2020-11-25 | Paper |
| Frege systems for quantified Boolean logic | 2020-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304106 | 2020-08-05 | Paper |
| Short proofs in QBF expansion | 2020-05-20 | Paper |
| Proof complexity of QBF symmetry recomputation | 2020-05-20 | Paper |
| Lower bound techniques for QBF expansion | 2020-04-15 | Paper |
| New resolution-based QBF calculi and their proof complexity | 2019-12-16 | Paper |
| Dynamic QBF dependencies in reduction and expansion | 2019-11-22 | Paper |
| Characterising tree-like Frege proofs for QBF | 2019-09-17 | Paper |
| Reinterpreting dependency schemes: soundness meets incompleteness in DQBF | 2019-09-02 | Paper |
| A game characterisation of tree-like Q-resolution size | 2019-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625702 | 2019-02-25 | Paper |
| Understanding cutting planes for QBFs | 2018-09-27 | Paper |
| Relating size and width in variants of Q-resolution | 2018-07-17 | Paper |
| Understanding Gentzen and Frege Systems for QBF | 2018-04-23 | Paper |
| Understanding cutting planes for QBFs | 2018-04-19 | Paper |
| Are Short Proofs Narrow? QBF Resolution Is Not So Simple | 2018-03-22 | Paper |
| Are Short Proofs Narrow? QBF Resolution is not Simple. | 2018-01-24 | Paper |
| Shortening QBF proofs with dependency schemes | 2017-11-15 | Paper |
| A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games | 2017-11-03 | 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 | 2016-09-05 | Paper |
| Lower bounds: from circuits to QBF proof systems | 2016-04-15 | Paper |
| A game characterisation of tree-like Q-resolution size | 2016-04-08 | Paper |
| Feasible interpolation for QBF resolution calculi | 2015-10-27 | Paper |
| Parameterized bounded-depth Frege is not optimal | 2015-09-24 | Paper |
| A tight Karp-Lipton collapse result in bounded arithmetic | 2015-09-17 | Paper |
| Parameterized Complexity of DPLL Search Procedures | 2015-09-17 | Paper |
| On Unification of QBF Resolution-Based Calculi | 2014-10-14 | Paper |
| The complexity of theorem proving in circumscription and minimal entailment | 2014-09-26 | Paper |
| Unified Characterisations of Resolution Hardness Measures | 2014-09-26 | Paper |
| A characterization of tree-like resolution size | 2014-04-11 | Paper |
| The complexity of theorem proving in autoepistemic logic | 2013-08-05 | Paper |
| Proof complexity of non-classical logics | 2012-11-01 | Paper |
| The complexity of reasoning for fragments of default logic | 2012-06-20 | Paper |
| Do there exist complete sets for promise classes? | 2011-12-23 | Paper |
| Proof systems that take advice | 2011-07-27 | Paper |
| Parameterized bounded-depth Frege is not optimal | 2011-07-06 | Paper |
| Parameterized complexity of DPLL search procedures | 2011-06-17 | Paper |
| The deduction theorem for strong propositional proof systems | 2010-08-13 | Paper |
| Proof Complexity of Non-classical Logics | 2010-06-17 | Paper |
| Different approaches to proof systems | 2010-06-17 | Paper |
| Comparing axiomatizations of free pseudospaces | 2009-10-23 | Paper |
| Nondeterministic functions and the existence of optimal proof systems | 2009-09-10 | Paper |
| Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes | 2009-08-18 | Paper |
| Does Advice Help to Prove Propositional Tautologies? | 2009-07-07 | Paper |
| On the correspondence between arithmetic theories and propositional proof systems – a survey | 2009-04-09 | Paper |
| Nondeterministic Instance Complexity and Proof Systems with Advice | 2009-04-02 | Paper |
| A Tight Karp-Lipton Collapse Result in Bounded Arithmetic | 2008-11-20 | Paper |
| Tuples of disjoint \(\mathsf{NP}\)-sets | 2008-06-17 | Paper |
| Logical Closure Properties of Propositional Proof Systems | 2008-05-27 | Paper |
| The Deduction Theorem for Strong Propositional Proof Systems | 2008-04-24 | Paper |
| Classes of representable disjoint \textsf{NP}-pairs | 2007-06-06 | Paper |
| Disjoint NP-pairs and propositional proof systems | 2007-05-11 | Paper |
| Tuples of Disjoint NP-Sets | 2007-05-02 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
