Slim | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/slim/SlimHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngSlimhttps://ac.tuwien.ac.at/tag/slim/A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Setshttps://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/Are Hitting Formulas Hard for Resolution?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/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/Co-Certificate Learning with SAT Modulo Symmetrieshttps://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/Computing twin-width with SAT and branch \& boundhttps://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/IPASIR-UP: User Propagators for CDCLhttps://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/Learning Small Decision Trees with Large Domainhttps://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/On the parameterized complexity of clustering problems for incomplete datahttps://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/SAT-Based Generation of Planar Graphshttps://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/SAT-Boosted Tabu Search for Coloring Massive Graphshttps://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/The Computational Complexity of Concise Hypersphere Classificationhttps://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/The Parameterized Complexity of Finding Concise Local Explanationshttps://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/A SAT Approach to Twin-Widthhttps://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/A SAT Attack on Rota’s Basis Conjecturehttps://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/Finding a Cluster in Incomplete Datahttps://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/Learning Large Bayesian Networks with Expert Constraintshttps://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/PACE Solver Description: DAGer - Cutting out Cycles with MaxSAThttps://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/SAT Backdoors: Depth Beats Sizehttps://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/SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)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/Threshold Treewidth and Hypertree Widthhttps://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/threshold-treewidth-and-hypertree-width-3/Tractable Abstract Argumentation via Backdoor-Treewidthhttps://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/Weighted Model Counting with Twin-Widthhttps://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/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs/Computing Optimal Hypertree Decompositions with SAThttps://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/Finding the Hardest Formulas for Resolutionhttps://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/Finding the Hardest Formulas for Resolution (Extended Abstract)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/Learning fast-inference Bayesian networkshttps://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/Parameterized Complexity of Small Decision Tree Learninghttps://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/SAT Modulo Symmetries for Graph Generationhttps://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/SAT-based Decision Tree Learning for Large Data Setshttps://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/The Parameterized Complexity of Clustering Incomplete Datahttps://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/Turbocharging Treewidth-Bounded Bayesian Network Structure Learninghttps://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/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/A Time Leap Challenge for SAT-Solvinghttps://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/Breaking Symmetries with RootClique and LexTopsorthttps://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/Computing Optimal Hypertree Decompositionshttps://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimal-hypertree-decompositions/Finding the Hardest Formulas for Resolutionhttps://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/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/Formalizing Graph Trail Properties in Isabelle/HOLhttps://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/MaxSAT-Based Postprocessing for Treedepthhttps://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/On Existential MSO and Its Relation to ETHhttps://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/On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rankhttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-clustering-incomplete-data-into-subspaces-of-small-rank/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/Threshold Treewidth and Hypertree Widthhttps://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/