Automated Deduction – CADE-20
From MaRDI portal
Publication:5394625
DOI10.1007/11532231zbMath1135.68550MaRDI QIDQ5394625
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11532231
Related Items
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers, sKizzo, Solving QBF with counterexample guided refinement, Logic-based ontology comparison and module extraction, with an application to DL-Lite, A self-adaptive multi-engine solver for quantified Boolean formulas, A solver for QBFs in negation normal form, Ranking function synthesis for bit-vector relations, Solving quantified constraint satisfaction problems, A Unified Framework for Certificate and Compilation for QBF, A Compact Representation for Syntactic Dependencies in QBFs, Beyond CNF: A Circuit-Based QBF Solver, Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas