Joshua Blinkhorn

According to our database, Joshua Blinkhorn authored at least 21 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl

ACM Trans. Comput. Log., April, 2023

2021

A simple proof of QBF hardness.

Olaf Beyersdorff, Joshua Blinkhorn

Inf. Process. Lett., 2021

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

Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl

Electron. Colloquium Comput. Complex., 2021

Davis and Putnam Meet Henkin: Solving DQBF with Resolution.

Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky

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

2020

Dynamic QBF Dependencies in Reduction and Expansion.

Olaf Beyersdorff, Joshua Blinkhorn

ACM Trans. Comput. Log., 2020

Lower Bound Techniques for QBF Expansion.

Olaf Beyersdorff, Joshua Blinkhorn

Theory Comput. Syst., 2020

Simulating DQBF Preprocessing Techniques with Resolution Asymmetric Tautologies.

Joshua Blinkhorn

Electron. Colloquium Comput. Complex., 2020

Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths.

Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl

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

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Hard QBFs for Merge Resolution.

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood

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

2019

Quantified Boolean formulas: proof complexity and models of solving.

Joshua Blinkhorn

PhD thesis, 2019

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF.

Olaf Beyersdorff, Joshua Blinkhorn, Leroy Chew, Renate A. Schmidt, Martin Suda

J. Autom. Reason., 2019

Proof Complexity of Symmetry Learning in QBF.

Olaf Beyersdorff, Joshua Blinkhorn

Electron. Colloquium Comput. Complex., 2019

Building Strategies into QBF Proofs.

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Proof Complexity of QBF Symmetry Recomputation.

Joshua Blinkhorn, Olaf Beyersdorff

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

2018

Genuine Lower Bounds for QBF Expansion.

Olaf Beyersdorff, Joshua Blinkhorn

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs.

Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Dynamic Dependency Awareness for QBF.

Joshua Blinkhorn, Olaf Beyersdorff

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds.

Olaf Beyersdorff, Joshua Blinkhorn

Electron. Colloquium Comput. Complex., 2017

Shortening QBF Proofs with Dependency Schemes.

Joshua Blinkhorn, Olaf Beyersdorff

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

Dependency Schemes in QBF Calculi: Semantics and Soundness.

Joshua Blinkhorn, Olaf Beyersdorff

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