Proof complexity of QBF symmetry recomputation

DOI10.1007/978-3-030-24258-9_3MaRDI QIDQ2181920zbMATH OpenOpenAlexFDO

Authors Joshua Blinkhorn, Olaf Beyersdorff

Publication date 20 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-24258-9_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20) Computational aspects of satisfiability (68R07)

Recommendations

• Short proofs for some symmetric quantified Boolean formulas
• Symmetries of quantified Boolean formulas
• New resolution-based QBF calculi and their proof complexity
• Proof complexity of resolution-based QBF calculi
• Dynamic QBF dependencies in reduction and expansion

Cited in

(4)

• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• Symmetries of quantified Boolean formulas
• Short proofs for some symmetric quantified Boolean formulas
• QBFFam: a tool for generating QBF families from proof complexity

This page was built for publication: Proof complexity of QBF symmetry recomputation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181920)