A Game Characterisation of Tree-like Q-resolution Size

A characterization of tree-like Resolution size ⬇️

scholarly article by Olaf Beyersdorff et al published September 2013 in Information Processing Letters

A game characterisation of tree-like Q-Resolution size

A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games ⬇️

article by Olaf Beyersdorff et al published November 2010 in Information Processing Letters

A tight Karp-Lipton collapse result in bounded arithmetic

article by Olaf Beyersdorff & Sebastian Müller published 1 July 2010 in ACM Transactions on Computational Logic

Are Short Proofs Narrow? QBF Resolution Is Not So Simple

Building Strategies into QBF Proofs

artículo científico publicado en 2020

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes ⬇️

Classes of representable disjoint NP-pairs ⬇️

Comparing axiomatizations of free pseudospaces ⬇️

Dependency Schemes in QBF Calculi: Semantics and Soundness ⬇️

Different Approaches to Proof Systems ⬇️

Disjoint NP-Pairs from Propositional Proof Systems ⬇️

Do there exist complete sets for promise classes?

Does Advice Help to Prove Propositional Tautologies? ⬇️

article by Olaf Beyersdorff & Sebastian Müller published 2009 in Lecture Notes in Computer Science

Feasible Interpolation for QBF Resolution Calculi

Lifting QBF Resolution Calculi to DQBF ⬇️

Lower Bounds ⬇️

article published in 2016

Model Checking CTL is Almost Always Inherently Sequential ⬇️

article by Olaf Beyersdorff et al published 17 May 2011 in Logical Methods in Computer Science

Model Checking CTL is Almost Always Inherently Sequential ⬇️

scholarly article published July 2009

Nondeterministic Instance Complexity and Proof Systems with Advice ⬇️

article by Olaf Beyersdorff et al published 2009 in Lecture Notes in Computer Science

Nondeterministic functions and the existence of optimal proof systems ⬇️

On Unification of QBF Resolution-Based Calculi ⬇️

On the Existence of Complete Disjoint NP-Pairs ⬇️

scholarly article published September 2009

On the correspondence between arithmetic theories and propositional proof systems - a survey ⬇️

Parameterized Bounded-Depth Frege Is Not Optimal ⬇️

Parameterized Bounded-Depth Frege Is not Optimal ⬇️

Parameterized Complexity of DPLL Search Procedures ⬇️

article published in 2013

Parameterized Complexity of DPLL Search Procedures ⬇️

Proof Complexity of Non-classical Logics ⬇️

Proof Complexity of Non-classical Logics

Proof Complexity of Propositional Default Logic ⬇️

Proof complexity of propositional default logic ⬇️

Proof systems that take advice

Shortening QBF Proofs with Dependency Schemes ⬇️

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths

artículo científico publicado en 2024

The Complexity of Reasoning for Fragments of Default Logic ⬇️

The Complexity of Theorem Proving in Autoepistemic Logic ⬇️

The Complexity of Theorem Proving in Circumscription and Minimal Entailment ⬇️

The Deduction Theorem for Strong Propositional Proof Systems ⬇️

article published in 2008

The complexity of propositional implication

The complexity of reasoning for fragments of default logic

Tuples of Disjoint NP-Sets ⬇️

Tuples of Disjoint NP-Sets ⬇️

Understanding Gentzen and Frege Systems for QBF ⬇️

Unified Characterisations of Resolution Hardness Measures ⬇️

Verifying Proofs in Constant Depth ⬇️

Verifying proofs in constant depth ⬇️