Name Venue Year citations
Should Decisions in QCDCL Follow Prefix Order? SAT 2022 1
Classes of Hard Formulas for QBF Resolution. SAT 2022 0
QCDCL with Cube Learning or Pure Literal Elimination - What is Best? IJCAI 2022 1
Lower Bounds for QCDCL via Formula Gauge. SAT 2021 2
QBFFam: A Tool for Generating QBF Families from Proof Complexity. SAT 2021 2
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. SAT 2020 2
Proof Complexity of QBF Symmetry Recomputation. SAT 2019 4
Short Proofs in QBF Expansion. SAT 2019 4
Dynamic Dependency Awareness for QBF. IJCAI 2018 0
Shortening QBF Proofs with Dependency Schemes. SAT 2017 14
Dependency Schemes in QBF Calculi: Semantics and Soundness. CP 2016 18
Lifting QBF Resolution Calculi to DQBF. SAT 2016 18
Unified Characterisations of Resolution Hardness Measures. SAT 2014 19
The Complexity of Theorem Proving in Autoepistemic Logic. SAT 2013 6
Parameterized Complexity of DPLL Search Procedures. SAT 2011 38
Proof Complexity of Propositional Default Logic. SAT 2010 8
Does Advice Help to Prove Propositional Tautologies? SAT 2009 4
The Complexity of Reasoning for Fragments of Default Logic. SAT 2009 0
Copyright ©2019 Universit├Ąt W├╝rzburg

Impressum | Privacy | FAQ