scientific article
From MaRDI portal
Publication:3624018
zbMath1183.68475arXiv1111.0860MaRDI QIDQ3624018
Armando Tacchella, Massimo Narizzano, Enrico Giunchiglia
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1111.0860
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The QBF Gallery: behind the scenes, Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API, QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving, Solving quantified constraint satisfaction problems, Conformant planning as a case study of incremental QBF solving, Long-distance Q-resolution with dependency schemes, Logic-based ontology comparison and module extraction, with an application to DL-Lite, Soundness of \(\mathcal{Q}\)-resolution with dependency schemes, Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution, Henkin quantifiers and Boolean formulae: a certification perspective of DQBF, Unified QBF certification and its applications, Abstraction-Based Algorithm for 2QBF, Failed Literal Detection for QBF, Lower bounds for QCDCL via formula gauge, Characterising tree-like Frege proofs for QBF, A Unified Framework for Certificate and Compilation for QBF, Building strategies into QBF proofs, On Q-Resolution and CDCL QBF Solving, Q-Resolution with Generalized Axioms, 2QBF: Challenges and Solutions, Long Distance Q-Resolution with Dependency Schemes, HordeQBF: A Modular and Massively Parallel QBF Solver, Dual proof generation for quantified Boolean formulas with a BDD-based solver, The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17), Non-binary quantified CSP: Algorithms and modelling, Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas, Expansion-based QBF solving versus Q-resolution, Lower bounds for QCDCL via formula gauge
Uses Software
