Automated Deduction – CADE-20

DOI10.1007/11532231zbMath1135.68550OpenAlexW2485416161MaRDI QIDQ5394625

Marco H. Benedetti

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

Mathematics Subject Classification ID

Related Items (18)

Solution validation and extraction for QBF preprocessing ⋮ Solving quantified constraint satisfaction problems ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Towards Parallel Boolean Functional Synthesis ⋮ Ranking function synthesis for bit-vector relations ⋮ Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers ⋮ A Unified Framework for Certificate and Compilation for QBF ⋮ Building strategies into QBF proofs ⋮ Incremental Determinization ⋮ 2QBF: Challenges and Solutions ⋮ A self-adaptive multi-engine solver for quantified Boolean formulas ⋮ A solver for QBFs in negation normal form ⋮ A Compact Representation for Syntactic Dependencies in QBFs ⋮ Beyond CNF: A Circuit-Based QBF Solver ⋮ sKizzo ⋮ Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers ⋮ Solving QBF with counterexample guided refinement

This page was built for publication: Automated Deduction – CADE-20