https://ac.tuwien.ac.at/tag/reveal/RevealHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/tag/reveal/https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/https://ac.tuwien.ac.at/publication/backdoor-dnfs-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-3/https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/https://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/https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/https://ac.tuwien.ac.at/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/https://ac.tuwien.ac.at/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets/https://ac.tuwien.ac.at/publication/are-hitting-formulas-hard-for-resolution/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/are-hitting-formulas-hard-for-resolution/https://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/https://ac.tuwien.ac.at/publication/co-certificate-learning-with-sat-modulo-symmetries/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/co-certificate-learning-with-sat-modulo-symmetries/https://ac.tuwien.ac.at/publication/computing-twin-width-with-sat-and-branch-bound/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-twin-width-with-sat-and-branch-bound/https://ac.tuwien.ac.at/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/inconsistent-cores-for-asp-the-perks-and-perils-of-non-monotonicity/https://ac.tuwien.ac.at/publication/ipasir-up-user-propagators-for-cdcl/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/ipasir-up-user-propagators-for-cdcl/https://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-problems-for-incomplete-data/https://ac.tuwien.ac.at/publication/proven-optimally-balanced-latin-rectangles-with-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/proven-optimally-balanced-latin-rectangles-with-sat/https://ac.tuwien.ac.at/publication/sat-based-generation-of-planar-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-generation-of-planar-graphs/https://ac.tuwien.ac.at/publication/sat-boosted-tabu-search-for-coloring-massive-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-boosted-tabu-search-for-coloring-massive-graphs/https://ac.tuwien.ac.at/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-computational-complexity-of-concise-hypersphere-classification/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/https://ac.tuwien.ac.at/publication/a-sat-approach-to-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-to-twin-width/https://ac.tuwien.ac.at/publication/a-sat-attack-on-rotas-basis-conjecture/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-attack-on-rotas-basis-conjecture/https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-a-cluster-in-incomplete-data/https://ac.tuwien.ac.at/publication/learning-large-bayesian-networks-with-expert-constraints/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-large-bayesian-networks-with-expert-constraints/https://ac.tuwien.ac.at/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-dager-cutting-out-cycles-with-maxsat/https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/https://ac.tuwien.ac.at/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-local-search-for-plane-subgraph-partitions-cg-challenge/https://ac.tuwien.ac.at/publication/tractable-abstract-argumentation-via-backdoor-treewidth/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-abstract-argumentation-via-backdoor-treewidth/https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/https://ac.tuwien.ac.at/publication/backdoor-dnfs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs/https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions-with-sat/https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-3/https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-extended-abstract/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution-extended-abstract/https://ac.tuwien.ac.at/publication/learning-fast-inference-bayesian-networks/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-fast-inference-bayesian-networks/https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/new-width-parameters-for-sat-and-sharp-sat/https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-small-decision-tree-learning/https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation/https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets/https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-clustering-incomplete-data/https://ac.tuwien.ac.at/publication/turbocharging-treewidth-bounded-bayesian-network-structure-learning/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/turbocharging-treewidth-bounded-bayesian-network-structure-learning/https://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/https://ac.tuwien.ac.at/publication/a-time-leap-challenge-for-sat-solving/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-time-leap-challenge-for-sat-solving/https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/breaking-symmetries-with-rootclique-and-lextopsort/https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-the-hardest-formulas-for-resolution/https://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/https://ac.tuwien.ac.at/publication/formalizing-graph-trail-properties-in-isabelle-hol/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/formalizing-graph-trail-properties-in-isabelle-hol/https://ac.tuwien.ac.at/publication/maxsat-based-postprocessing-for-treedepth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/maxsat-based-postprocessing-for-treedepth/https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/https://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/https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width/