1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.LO2026
Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking
Leroy Chew, Tomáš Peitl
Certification for Quantified Boolean Formulas (QBF) and Dependency Quantified Boolean Formulas (DQBF) is an ongoing challenge. Recent proof complexity work has shown that the major…
cs.AI2025
Smart Cubing for Graph Search: A Comparative Study
Markus Kirchweger, Hai Xia, Tomáš Peitl +1
Parallel solving via cube-and-conquer is a key method for scaling SAT solvers to hard instances. While cube-and-conquer has proven successful for pure SAT problems, notably the Pyt…
cs.CC2020★ 1 cited
Hard QBFs for Merge Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan +2
We prove the first genuine QBF proof size lower bounds for the proof system Merge Resolution (MRes [Olaf Beyersdorff et al., 2020]), a refutational proof system for prenex quantifi…