scientific article
From MaRDI portal
Publication:2954985
DOI10.4230/LIPIcs.STACS.2015.76zbMath1355.68105MaRDI QIDQ2954985
Mikoláš Janota, Olaf Beyersdorff, Leroy Chew
Publication date: 24 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (30)
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ⋮ The QBF Gallery: behind the scenes ⋮ Feasible Interpolation for QBF Resolution Calculi ⋮ QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving ⋮ Unnamed Item ⋮ Conformant planning as a case study of incremental QBF solving ⋮ A simple proof of QBF hardness ⋮ Lower Bound Techniques for QBF Proof Systems ⋮ Long-distance Q-resolution with dependency schemes ⋮ Unnamed Item ⋮ A game characterisation of tree-like Q-resolution size ⋮ Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable ⋮ Lower bound techniques for QBF expansion ⋮ Characterising tree-like Frege proofs for QBF ⋮ Unnamed Item ⋮ Understanding cutting planes for QBFs ⋮ Short proofs for some symmetric quantified Boolean formulas ⋮ On Stronger Calculi for QBFs ⋮ Q-Resolution with Generalized Axioms ⋮ Lifting QBF Resolution Calculi to DQBF ⋮ Long Distance Q-Resolution with Dependency Schemes ⋮ Unnamed Item ⋮ Reinterpreting dependency schemes: soundness meets incompleteness in DQBF ⋮ Unnamed Item ⋮ Unnamed Item ⋮ How QBF expansion makes strategy extraction hard ⋮ On Exponential Lower Bounds for Partially Ordered Resolution ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers ⋮ Solving QBF with counterexample guided refinement ⋮ Hardness and optimality in QBF proof systems modulo NP
This page was built for publication:
