scientific article; zbMATH DE number 6734401

DOI10.23638/LMCS-13(2:7)2017zbMath1448.68456MaRDI QIDQ5270089

Meena Mahajan, Olaf Beyersdorff, Leroy Chew, Anil K. Shukla

Publication date: 22 June 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

resolutionproof complexityQBFfeasible interpolation

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (14)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ⋮ Proof complexity of modal resolution ⋮ Relating size and width in variants of Q-resolution ⋮ Lower Bound Techniques for QBF Proof Systems ⋮ Unnamed Item ⋮ Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution ⋮ Lower bound techniques for QBF expansion ⋮ Lower bounds for QCDCL via formula gauge ⋮ Understanding cutting planes for QBFs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ How QBF expansion makes strategy extraction hard ⋮ QBFFam: a tool for generating QBF families from proof complexity ⋮ Lower bounds for QCDCL via formula gauge

Uses Software

• Quaffle

This page was built for publication: