Friedrich Slivovsky | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/friedrich-slivovsky/Friedrich SlivovskyHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngFriedrich Slivovskyhttps://ac.tuwien.ac.at/team/friedrich-slivovsky/eSLIM: Circuit Minimization with SAT Based Local Improvementhttps://ac.tuwien.ac.at/publication/eslim-circuit-minimization-with-sat-based-local-improvement/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/eslim-circuit-minimization-with-sat-based-local-improvement/Hardness of Random Reordered Encodings of Parity for Resolution and CDCLhttps://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/Improved Circuit Minimization with Exact Synthesishttps://ac.tuwien.ac.at/publication/improved-circuit-minimization-with-exact-synthesis/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-circuit-minimization-with-exact-synthesis/Circuit Minimization with Exact Synthesis: From QBF Back to SAThttps://ac.tuwien.ac.at/publication/circuit-minimization-with-exact-synthesis-from-qbf-back-to-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/circuit-minimization-with-exact-synthesis-from-qbf-back-to-sat/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/Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBFhttps://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf/Pedant: A Certifying DQBF Solverhttps://ac.tuwien.ac.at/publication/pedant-a-certifying-dqbf-solver/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/pedant-a-certifying-dqbf-solver/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/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/Certified DQBF Solving by Definition Extractionhttps://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/certified-dqbf-solving-by-definition-extraction/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/Davis and Putnam Meet Henkin: Solving DQBF with Resolutionhttps://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/davis-and-putnam-meet-henkin-solving-dqbf-with-resolution/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-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-symbolic-qbf-reasoning-2/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-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-faster-algorithm-for-propositional-model-counting-parameterized-by-incidence-treewidth-2/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-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-dependency-qbf-with-structural-parameters-2/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-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/short-q-resolution-proofs-with-homomorphisms-2/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/Combining Resolution-Path Dependencies with Dependency Learninghttps://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning-2/Combining Resolution-Path Dependencies with Dependency Learninghttps://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-resolution-path-dependencies-with-dependency-learning/Dependency Learning for QBFhttps://ac.tuwien.ac.at/publication/dependency-learning-for-qbf-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/dependency-learning-for-qbf-2/Long-Distance Q-Resolution with Dependency Schemeshttps://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-3/Proof Complexity of Fragments of Long-Distance Q-resolutionhttps://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution-2/Proof Complexity of Fragments of Long-Distance Q-resolutionhttps://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/proof-complexity-of-fragments-of-long-distance-q-resolution/Polynomial-Time Validation of QCDCL Certificateshttps://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates-2/Polynomial-Time Validation of QCDCL Certificateshttps://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/polynomial-time-validation-of-qcdcl-certificates/Portfolio Solvers for QDIMACS and QCIRhttps://ac.tuwien.ac.at/publication/portfolio-solvers-for-qdimacs-and-qcir/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-solvers-for-qdimacs-and-qcir/Portfolio-Based Algorithm Selection for Circuit QBFshttps://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-2/Portfolio-Based Algorithm Selection for Circuit QBFshttps://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-3/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs-3/Portfolio-Based Algorithm Selection for Circuit QBFshttps://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/portfolio-based-algorithm-selection-for-circuit-qbfs/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/Dependency Learning for QBFhttps://ac.tuwien.ac.at/publication/dependency-learning-for-qbf/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/dependency-learning-for-qbf/Long-Distance Q-Resolution with Dependency Schemeshttps://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes-2/Knowledge Compilation Meets Communication Complexityhttps://ac.tuwien.ac.at/publication/knowledge-compilation-meets-communication-complexity/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/knowledge-compilation-meets-communication-complexity/Long Distance Q-Resolution with Dependency Schemeshttps://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/long-distance-q-resolution-with-dependency-schemes/Meta-Kernelization with Structural Parametershttps://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters-2/Model Counting for CNF Formulas of Bounded Modular Treewidthhttps://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth-2/Quantifier reordering for QBFhttps://ac.tuwien.ac.at/publication/quantifier-reordering-for-qbf/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/quantifier-reordering-for-qbf/Soundness of Q-resolution with dependency schemeshttps://ac.tuwien.ac.at/publication/soundness-of-q-resolution-with-dependency-schemes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/soundness-of-q-resolution-with-dependency-schemes/On Compiling CNFs into Structured Deterministic DNNFshttps://ac.tuwien.ac.at/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-compiling-cnfs-into-structured-deterministic-dnnfs/On Compiling Structured CNFs to OBDDshttps://ac.tuwien.ac.at/publication/on-compiling-structured-cnfs-to-obdds/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-compiling-structured-cnfs-to-obdds/Variable Dependencies and Q-Resolutionhttps://ac.tuwien.ac.at/publication/variable-dependencies-and-q-resolution/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-dependencies-and-q-resolution/Meta-kernelization with Structural Parametershttps://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-kernelization-with-structural-parameters/Model Counting for CNF Formulas of Bounded Modular Treewidthhttps://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-counting-for-cnf-formulas-of-bounded-modular-treewidth/Model Counting for Formulas of Bounded Clique-Widthhttps://ac.tuwien.ac.at/publication/model-counting-for-formulas-of-bounded-clique-width/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-counting-for-formulas-of-bounded-clique-width/Computing Resolution-Path Dependencies in Linear Timehttps://ac.tuwien.ac.at/publication/computing-resolution-path-dependencies-in-linear-time/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-resolution-path-dependencies-in-linear-time/