Nenofex: Expanding NNF for QBF Solving
From MaRDI portal
Publication:3502708
DOI10.1007/978-3-540-79719-7_19zbMath1138.68546OpenAlexW1513754266MaRDI QIDQ3502708
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_19
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Conformant planning as a case study of incremental QBF solving ⋮ Never trust your solver: certification for SAT and QBF ⋮ Unnamed Item ⋮ Failed Literal Detection for QBF ⋮ Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers ⋮ A Unified Framework for Certificate and Compilation for QBF ⋮ Blocked Clause Elimination for QBF ⋮ Incremental Determinization ⋮ Non-prenex QBF Solving Using Abstraction ⋮ Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits ⋮ Nenofex ⋮ Expansion-based QBF solving versus Q-resolution ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers ⋮ Solving QBF with counterexample guided refinement
Uses Software
This page was built for publication: Nenofex: Expanding NNF for QBF Solving
