Olaf Beyersdorff

Luke Hinde

Ján Pich

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

SAT and Interactions (Dagstuhl Seminar 16381).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

Are Short Proofs Narrow? QBF Resolution is not Simple.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Dependency Schemes in QBF Calculi: Semantics and Soundness.

[BibT_eX]

[DOI]

Joshua Blinkhorn

Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), 2016

Lifting QBF Resolution Calculi to DQBF.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Understanding Gentzen and Frege Systems for QBF.

[BibT_eX]

[DOI]

Ján Pich

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Lower Bounds: From Circuits to QBF Proof Systems.

[BibT_eX]

[DOI]

Ilario Bonacina

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Understanding Cutting Planes for QBFs.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Extension Variables in QBF Resolution.

[BibT_eX]

[DOI]

Mikolas Janota

Proceedings of the Beyond NP, 2016

2015

Proof Complexity of Resolution-based QBF Calculi.

[BibT_eX]

[DOI]

Mikolás Janota

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

A Game Characterisation of Tree-like Q-resolution Size.

[BibT_eX]

[DOI]

Karteek Sreenivasaiah

Proceedings of the Language and Automata Theory and Applications, 2015

Feasible Interpolation for QBF Resolution Calculi.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Tableau vs. Sequent Calculi for Minimal Entailment.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Optimal algorithms and proofs (Dagstuhl Seminar 14421).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Unified Characterisations of Resolution Hardness Measures.

[BibT_eX]

[DOI]

Oliver Kullmann

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

On Unification of QBF Resolution-Based Calculi.

[BibT_eX]

[DOI]

Mikolas Janota

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

The Complexity of Theorem Proving in Circumscription and Minimal Entailment.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

The Complexity of Theorem Proving in Autoepistemic Logic.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

2012

A Characterization of Tree-Like Resolution Size.

[BibT_eX]

[DOI]

Gido Scharfenberger-Fabian

Electron. Colloquium Comput. Complex., 2012

Verifying Proofs in Constant Depth.

[BibT_eX]

[DOI]

Karteek Sreenivasaiah

Michael Thomas

Heribert Vollmer

Electron. Colloquium Comput. Complex., 2012

Non-classical Aspects in Proof Complexity.

[BibT_eX]

[DOI]

Cuvillier, ISBN: 978-3-9540403-6-0, 2012

2011

Do there exist complete sets for promise classes?

[BibT_eX]

[DOI]

Zenon Sadowski

Math. Log. Q., 2011

Parameterized Complexity of DPLL Search Procedures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Verifying Proofs in Constant Depth.

[BibT_eX]

[DOI]

Gido Scharfenberger-Fabian

Samir Datta

Meena Mahajan

Karteek Sreenivasaiah

Michael Thomas

Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Parameterized Bounded-Depth Frege Is Not Optimal.

[BibT_eX]

[DOI]

Alexander A. Razborov

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Proof Complexity of Non-classical Logics.

[BibT_eX]

[DOI]

Oliver Kutz

Proceedings of the Lectures on Logic and Computation, 2011

2010

A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Different Approaches to Proof Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Proof Complexity of Non-classical Logics.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Proof Complexity of Propositional Default Logic.

[BibT_eX]

[DOI]

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Hardness of Parameterized Resolution.

[BibT_eX]

[DOI]

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

2009

Nondeterministic functions and the existence of optimal proof systems.

[BibT_eX]

[DOI]

Johannes Köbler

Jochen Messner

Theor. Comput. Sci., 2009

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

[BibT_eX]

[DOI]

Math. Log. Q., 2009

The complexity of propositional implication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Proof Systems that Take Advice.

[BibT_eX]

[DOI]

Johannes Köbler

Electron. Colloquium Comput. Complex., 2009

Comparing axiomatizations of free pseudospaces.

[BibT_eX]

[DOI]

Arch. Math. Log., 2009

Model Checking CTL is Almost Always Inherently Sequential.

[BibT_eX]

[DOI]

Proceedings of the TIME 2009, 2009

On the Existence of Complete Disjoint NP-Pairs.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

The Complexity of Reasoning for Fragments of Default Logic.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Does Advice Help to Prove Propositional Tautologies?

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Nondeterministic Instance Complexity and Proof Systems with Advice.

[BibT_eX]

[DOI]

Johannes Köbler

Proceedings of the Language and Automata Theory and Applications, 2009

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

[BibT_eX]

[DOI]

Zenon Sadowski

Proceedings of the Computer Science, 2009

Edges as Nodes - a New Approach to Timetable Information .

[BibT_eX]

[DOI]

Yevgen Nebesov

Proceedings of the ATMOS 2009, 2009

2008

Logical Closure Properties of Propositional Proof Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

Classes of representable disjoint NP-pairs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The Deduction Theorem for Strong Propositional Proof Systems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Disjoint NP-pairs and propositional proof systems.

[BibT_eX]

[DOI]

PhD thesis, 2006

On the Deduction Theorem and Complete Disjoint NP-Pairs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Disjoint NP-Pairs from Propositional Proof Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

Tuples of Disjoint NP-Sets.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

2004

Representable Disjoint NP-Pairs.

[BibT_eX]

[DOI]