L2solve | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/l2solve/L2solveHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngL2solvehttps://ac.tuwien.ac.at/tag/l2solve/Circuit Minimization with QBF-Based Exact Synthesishttps://ac.tuwien.ac.at/publication/circuit-minimization-with-qbf-based-exact-synthesis/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/circuit-minimization-with-qbf-based-exact-synthesis/Towards Uniform Certification in QBFhttps://ac.tuwien.ac.at/publication/towards-uniform-certification-in-qbf/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/towards-uniform-certification-in-qbf/Certified DQBF Solving by Definition Extractionhttps://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction-2/Davis and Putnam Meet Henkin: Solving DQBF with Resolutionhttps://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution-2/Engineering an Efficient Boolean Functional Synthesis Enginehttps://ac.tuwien.ac.at/publication/engineering-an-efficient-boolean-functional-synthesis-engine/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/engineering-an-efficient-boolean-functional-synthesis-engine/Proof Complexity of Symbolic QBF Reasoninghttps://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning/A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidthhttps://ac.tuwien.ac.at/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth/Fixed-Parameter Tractability of Dependency QBF with Structural Parametershttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters/Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessinghttps://ac.tuwien.ac.at/publication/interpolation-based-semantic-gate-extraction-and-its-applications-to-qbf-preprocessing/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/interpolation-based-semantic-gate-extraction-and-its-applications-to-qbf-preprocessing/Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundnesshttps://ac.tuwien.ac.at/publication/multi-linear-strategy-extraction-for-qbf-expansion-proofs-via-local-soundness/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/multi-linear-strategy-extraction-for-qbf-expansion-proofs-via-local-soundness/Short Q-Resolution Proofs with Homomorphismshttps://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms/