Joshua Blinkhorn

33 papers A* 2A 8Journal 20Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Hard QBFs for Merge Resolution.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2023 J jnl
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.
ACM Trans. Comput. Log.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl
2021 J jnl
A simple proof of QBF hardness.
Inf. Process. Lett.
Olaf Beyersdorff, Joshua Blinkhorn
2021 J jnl
Building Strategies into QBF Proofs.
J. Autom. Reason.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan
2021 A conf
Davis and Putnam Meet Henkin: Solving DQBF with Resolution.
SAT
Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky
2021 J jnl
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
2020 J jnl
Dynamic QBF Dependencies in Reduction and Expansion.
ACM Trans. Comput. Log.
Olaf Beyersdorff, Joshua Blinkhorn
2020 — conf
Hard QBFs for Merge Resolution.
FSTTCS
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2020 J jnl
Hard QBFs for Merge Resolution.
CoRR
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2020 J jnl
Hard QBFs for Merge Resolution.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood
2020 A* conf
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.
LICS
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan
2020 J jnl
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan
2020 J jnl
Lower Bound Techniques for QBF Expansion.
Theory Comput. Syst.
Olaf Beyersdorff, Joshua Blinkhorn
2020 J jnl
Simulating DQBF Preprocessing Techniques with Resolution Asymmetric Tautologies.
Electron. Colloquium Comput. Complex.
Joshua Blinkhorn
2020 A conf
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths.
SAT
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
2020 J jnl
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl
2019 A conf
Building Strategies into QBF Proofs.
STACS
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan
2019 A conf
Proof Complexity of QBF Symmetry Recomputation.
SAT
Joshua Blinkhorn, Olaf Beyersdorff
2019 J jnl
Proof Complexity of Symmetry Learning in QBF.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn
2019 — —
Quantified Boolean formulas: proof complexity and models of solving.
Joshua Blinkhorn
2019 J jnl
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF.
J. Autom. Reason.
Olaf Beyersdorff, Joshua Blinkhorn, Leroy Chew, Renate A. Schmidt, Martin Suda
2019 J jnl
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs.
Log. Methods Comput. Sci.
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
2018 J jnl
Building Strategies into QBF Proofs.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan
2018 A* conf
Dynamic Dependency Awareness for QBF.
IJCAI
Joshua Blinkhorn, Olaf Beyersdorff
2018 A conf
Genuine Lower Bounds for QBF Expansion.
STACS
Olaf Beyersdorff, Joshua Blinkhorn
2018 A conf
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs.
ITCS
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
2017 J jnl
Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn
2017 A conf
Shortening QBF Proofs with Dependency Schemes.
SAT
Joshua Blinkhorn, Olaf Beyersdorff
2017 J jnl
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs.
CoRR
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
2017 J jnl
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
2016 A conf
Dependency Schemes in QBF Calculi: Semantics and Soundness.
CP
Olaf Beyersdorff, Joshua Blinkhorn
2016 — conf
Dependency Schemes in QBF Calculi: Semantics and Soundness.
QBF@SAT
Joshua Blinkhorn, Olaf Beyersdorff
2016 J jnl
Dependency Schemes in QBF Calculi: Semantics and Soundness.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Joshua Blinkhorn