| 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?
Journal of Automated Reasoning | 2024-04-29 | Paper |
Lower bounds for QCDCL via formula gauge
Journal of Automated Reasoning | 2023-10-24 | Paper |
Classes of hard formulas for QBF resolution
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
Logical Methods in Computer Science | 2023-08-26 | Paper |
Proof Complexity of Quantified Boolean Logic — A Survey
Mathematics for Computation (M4C) | 2023-08-04 | Paper |
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
ACM Transactions on Computational Logic | 2023-04-05 | Paper |
Reasons for hardness in QBF proof systems
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
scientific article; zbMATH DE number 7559123 (Why is no real title available?)
| 2022-07-18 | Paper |
Proof complexity of modal resolution
Journal of Automated Reasoning | 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
Journal of Automated Reasoning | 2021-06-09 | Paper |
Strong (D)QBF dependency schemes via tautology-free resolution paths
| 2021-04-07 | Paper |
A simple proof of QBF hardness
Information Processing Letters | 2021-03-11 | Paper |
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
scientific article; zbMATH DE number 7278086 (Why is no real title available?)
| 2020-11-25 | Paper |
Frege systems for quantified Boolean logic
Journal of the ACM | 2020-11-11 | Paper |
scientific article; zbMATH DE number 7228403 (Why is no real title available?)
| 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
Theory of Computing Systems | 2020-04-15 | Paper |
New resolution-based QBF calculi and their proof complexity
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Dynamic QBF dependencies in reduction and expansion
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Characterising tree-like Frege proofs for QBF
Information and Computation | 2019-09-17 | 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 |
scientific article; zbMATH DE number 7029312 (Why is no real title available?)
| 2019-02-25 | Paper |
Understanding cutting planes for QBFs
Information and Computation | 2018-09-27 | Paper |
Relating size and width in variants of Q-resolution
Information Processing Letters | 2018-07-17 | Paper |
Understanding Gentzen and Frege Systems for QBF
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Understanding cutting planes for QBFs
| 2018-04-19 | Paper |
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
ACM Transactions on Computational Logic | 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
Information Processing Letters | 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
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Lower bounds: from circuits to QBF proof systems
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | 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 |
Parameterized bounded-depth Frege is not optimal
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic | 2015-09-17 | 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 |
Unified Characterisations of Resolution Hardness Measures
Lecture Notes in Computer Science | 2014-09-26 | Paper |
A characterization of tree-like resolution size
Information Processing Letters | 2014-04-11 | Paper |
The complexity of theorem proving in autoepistemic logic
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Proof complexity of non-classical logics
Lecture Notes in Computer Science | 2012-11-01 | Paper |
The complexity of reasoning for fragments of default logic
Journal of Logic and Computation | 2012-06-20 | Paper |
Do there exist complete sets for promise classes?
Mathematical Logic Quarterly | 2011-12-23 | Paper |
Proof systems that take advice
Information and Computation | 2011-07-27 | Paper |
Parameterized bounded-depth Frege is not optimal
Automata, Languages and Programming | 2011-07-06 | Paper |
Parameterized complexity of DPLL search procedures
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
The deduction theorem for strong propositional proof systems
Theory of Computing Systems | 2010-08-13 | Paper |
Proof Complexity of Non-classical Logics
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Different approaches to proof systems
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Comparing axiomatizations of free pseudospaces
Archive for Mathematical Logic | 2009-10-23 | Paper |
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science | 2009-09-10 | Paper |
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Does Advice Help to Prove Propositional Tautologies?
Lecture Notes in Computer Science | 2009-07-07 | Paper |
On the correspondence between arithmetic theories and propositional proof systems – a survey
Mathematical Logic Quarterly | 2009-04-09 | Paper |
Nondeterministic Instance Complexity and Proof Systems with Advice
Language and Automata Theory and Applications | 2009-04-02 | Paper |
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
Computer Science Logic | 2008-11-20 | Paper |
Tuples of disjoint \(\mathsf{NP}\)-sets
Theory of Computing Systems | 2008-06-17 | Paper |
Logical Closure Properties of Propositional Proof Systems
Lecture Notes in Computer Science | 2008-05-27 | Paper |
The Deduction Theorem for Strong Propositional Proof Systems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Classes of representable disjoint \textsf{NP}-pairs
Theoretical Computer Science | 2007-06-06 | Paper |
Disjoint NP-pairs and propositional proof systems
| 2007-05-11 | Paper |
Tuples of Disjoint NP-Sets
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
