scientific article; zbMATH DE number 1950260
From MaRDI portal
Publication:4412858
zbMath1015.68173MaRDI QIDQ4412858
Publication date: 17 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2381/23810160.htm
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 (19)
The QBF Gallery: behind the scenes ⋮ Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ The complexity of pure literal elimination ⋮ Conformant planning as a case study of incremental QBF solving ⋮ OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ Never trust your solver: certification for SAT and QBF ⋮ Subsumption-linear Q-resolution for QBF theorem proving ⋮ From QBFs to \textsf{MALL} and back via focussing ⋮ On deciding subsumption problems ⋮ Computational methods for database repair by signed formulae ⋮ Q-Resolution with Generalized Axioms ⋮ HordeQBF: A Modular and Massively Parallel QBF Solver ⋮ Validating QBF Validity in HOL4 ⋮ A solver for QBFs in negation normal form ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ A Compact Representation for Syntactic Dependencies in QBFs ⋮ semprop ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ Solving QBF with counterexample guided refinement
Uses Software
This page was built for publication:
