Strong (D)QBF dependency schemes via tautology-free resolution paths

DOI10.1007/978-3-030-51825-7_28OpenAlexW3039621816MaRDI QIDQ2661365

Olaf Beyersdorff, Tomáš Peitl, Joshua Blinkhorn

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_28

zbMATH Keywords

proof complexityQBFdependency schemesDQBF

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• DepQBF

This page was built for publication: Strong (D)QBF dependency schemes via tautology-free resolution paths