• Publications
  • Influence
Inprocessing Rules
TLDR
The formal underpinnings of inprocessing SAT solving are established via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques. Expand
Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming
TLDR
A new approach is presented that preserves the versatility of Boolean constraint solving and attains a high accuracy despite the presence of statistical errors, and develops a new logical encoding of (in)dependence constraints that is both well suited for the domain and allows for faster solving. Expand
Blocked Clause Elimination
TLDR
This work shows that BCE is surprisingly effective both in theory and in practice on CNFs resulting from a standard CNF encoding for circuits: without explicit knowledge of the underlying circuit structure, it achieves the same level of simplification as a combination of circuit-level simplifications and previously suggested polarity-based CNF encodings. Expand
The International SAT Solver Competitions
The International SAT Solver Competition is today an established series of competitive events aiming at objectively evaluating the progress in state-of-the-art procedures for solving BooleanExpand
Complexity-sensitive decision procedures for abstract argumentation
TLDR
This work presents a generic approach for reasoning over AFs, based on the novel concept of complexity-sensitivity, and derives several new complexity results for preferred, semi-stable and stage semantics which complement the current complexity landscape for abstract argumentation. Expand
LMHS: A SAT-IP Hybrid MaxSAT Solver
TLDR
LMHS is a hybrid SAT-IP MaxSat solver that implements the implicit hitting set approach to MaxSAT and offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers. Expand
Clause Elimination for SAT and QSAT
TLDR
It turns out that the importance of applying the clause elimination procedures developed in this work is empirically emphasized in the context of state-of-the-art QSAT solving. Expand
SAT-Based Approaches to Treewidth Computation: An Evaluation
TLDR
The applicability of Boolean satisfiability (SAT) based approaches to determining the tree widths of graphs, and at the same time obtaining an associated optimal tree-decomposition, is studied. Expand
Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure
TLDR
This work presents a very general approach to learning the structure of causal models based on d-separation constraints, obtained from any given set of overlapping passive observational or experimental data sets, based on a logical representation of causal pathways. Expand
Simulating Circuit-Level Simplifications on CNF
TLDR
This work shows that BCE is surprisingly effective both in theory and in practice on CNF formulas resulting from a standard CNF encoding for circuits: without explicit knowledge of the underlying circuit structure, it achieves the same level of simplification as a combination of circuit-level simplifications and previously suggested polarity-based CNF encodings. Expand
...
1
2
3
4
5
...