André Schidler
YOU?
Author Swipe
View article: Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach Open
The implicit hitting set (IHS) approach offers a general framework for solving computationally hard combinatorial optimization problems declaratively. IHS iterates between a decision oracle used for extracting sources of inconsistency and …
View article: Extracting Problem Structure with LLMs for Optimized SAT Local Search
Extracting Problem Structure with LLMs for Optimized SAT Local Search Open
Encoding combinatorial problems in terms of propositional satisfiability (SAT) enables utilization of highly efficient SAT solvers for combinatorial search. Local search preprocessing accelerates the SAT solver's search by providing high-q…
View article: SAT-based Decision Tree Learning for Large Data Sets
SAT-based Decision Tree Learning for Large Data Sets Open
Decision trees of low depth are beneficial for understanding and interpreting the data they represent. Unfortunately, finding a decision tree of lowest complexity (depth or size) that correctly represents given data is NP-hard. Hence known…
View article: Backdoor DNFs
Backdoor DNFs Open
We introduce backdoor DNFs, as a tool to measure the theoretical hardness of CNF formulas. Like backdoor sets and backdoor trees, backdoor DNFs are defined relative to a tractable class of CNF formulas. Each conjunctive term of a backdoor …
View article: Computing optimal hypertree decompositions with SAT
Computing optimal hypertree decompositions with SAT Open
Hypertree width is a prominent hypergraph invariant with many algorithmic applications in constraint satisfaction and databases. We propose two novel characterisations for hypertree width in terms of linear orderings. We utilize these char…
View article: Computing Twin-width with SAT and Branch & Bound
Computing Twin-width with SAT and Branch & Bound Open
The graph width-measure twin-width recently attracted great attention because of its solving power and generality. Many prominent NP-hard problems are tractable on graphs of bounded twin-width if a certificate for the twin-width bound is p…
View article: SAT-boosted Tabu Search for Coloring Massive Graphs
SAT-boosted Tabu Search for Coloring Massive Graphs Open
Graph coloring is the problem of coloring the vertices of a graph with as few colors as possible, avoiding monochromatic edges. It is one of the most fundamental NP-hard computational problems. For decades researchers have developed exact …
View article: Computing twin-width with SAT and branch & bound - Results
Computing twin-width with SAT and branch & bound - Results Open
The experimental results, including instances.
View article: Computing twin-width with SAT and branch & bound - Results
Computing twin-width with SAT and branch & bound - Results Open
The experimental results, including instances.
View article: SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments
SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments Open
The experimental data for the paper of the same name.
View article: SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments
SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments Open
The experimental data for the paper of the same name.
View article: A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets Open
We propose a new approach to the Directed Feedback Vertex Set Problem (DFVSP), where the input is a directed graph and the solution is a minimum set of vertices whose removal makes the graph acyclic. Our approach, implemented in the solver…
View article: A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets - Results
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets - Results Open
The Results for the paper of the same name, published at ALENEX 2023.
View article: A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets - Results
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets - Results Open
The Results for the paper of the same name, published at ALENEX 2023.
View article: Scalability for SAT-based combinatorial problem solving - Results
Scalability for SAT-based combinatorial problem solving - Results Open
The experimental results for the referenced thesis.
View article: Scalability for SAT-based combinatorial problem solving - Results
Scalability for SAT-based combinatorial problem solving - Results Open
The experimental results for the referenced thesis.
View article: Threshold Treewidth and Hypertree Width
Threshold Treewidth and Hypertree Width Open
Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in pol…
View article: Computing Optimal Hypertree Decompositions with SAT - Results
Computing Optimal Hypertree Decompositions with SAT - Results Open
The data from our experiments.
View article: Computing Optimal Hypertree Decompositions with SAT - Results
Computing Optimal Hypertree Decompositions with SAT - Results Open
The data from our experiments.
View article: Tractable Abstract Argumentation via Backdoor-Treewidth
Tractable Abstract Argumentation via Backdoor-Treewidth Open
Argumentation frameworks (AFs) are a core formalism in the field of formal argumentation. As most standard computational tasks regarding AFs are hard for the first or second level of the Polynomial Hierarchy, a variety of algorithmic appro…
View article: Weighted Model Counting with Twin-Width
Weighted Model Counting with Twin-Width Open
Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and showed that many NP-hard problems are tractable for graphs of bounded twin-width, generalizing similar results for other width measures, including treewidth and clique…
View article: Weighted Model Counting with Twin-Width: Experimental Results
Weighted Model Counting with Twin-Width: Experimental Results Open
The results of our paper "Weighted Model Counting with Twin-Width" published at SAT 2022
View article: Weighted Model Counting with Twin-Width: Experimental Results
Weighted Model Counting with Twin-Width: Experimental Results Open
The results of our paper "Weighted Model Counting with Twin-Width" published at SAT 2022
View article: CG:Shop 2022 Results: SAT-Based Local Search for Plane Subgraph Partitions
CG:Shop 2022 Results: SAT-Based Local Search for Plane Subgraph Partitions Open
The results for the CG:SHOP 2022 challenge achieved by team tuwien.
View article: CG:Shop 2022 Results: SAT-Based Local Search for Plane Subgraph Partitions
CG:Shop 2022 Results: SAT-Based Local Search for Plane Subgraph Partitions Open
The results for the CG:SHOP 2022 challenge achieved by team tuwien.
View article: A SAT Approach to Twin-Width
A SAT Approach to Twin-Width Open
The graph invariant twin-width was recently introduced by Bonnet, Kim, Thomassé, and Watrigan. Problems expressible in first-order logic, which includes many prominent NP-hard problems, are tractable on graphs of bounded twin-width if a ce…
View article: A SAT Approach to Twin-Width
A SAT Approach to Twin-Width Open
Results for the paper "A SAT Approach to Twin-Width" to appear at ALENEX 2022.
View article: A SAT Approach to Twin-Width
A SAT Approach to Twin-Width Open
Results for the paper "A SAT Approach to Twin-Width" to appear at ALENEX 2022.
View article: Computing Optimal Hypertree Decompositions with SAT
Computing Optimal Hypertree Decompositions with SAT Open
Hypertree width is a prominent hypergraph invariant with many algorithmic applications in constraint satisfaction and databases. We propose a novel characterization for hypertree width in terms of linear elimination orderings. We utilize t…