• Publications
  • Influence
Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming
Recent approaches to causal discovery based on Boolean satisfiability solvers have opened new opportunities to consider search spaces for causal models with both feedback cycles and unmeasuredExpand
  • 70
  • 17
Inprocessing Rules
Decision procedures for Boolean satisfiability (SAT), especially modern conflict-driven clause learning (CDCL) solvers, act routinely as core solving engines in various real-world applications.Expand
  • 161
  • 16
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessing, and search. It isExpand
  • 121
  • 13
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
  • 126
  • 9
Clause Elimination for SAT and QSAT
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarativeExpand
  • 52
  • 7
Complexity-sensitive decision procedures for abstract argumentation
Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems in the areas of Knowledge Representation and Artificial Intelligence. Efficient evaluation of AFs has thusExpand
  • 90
  • 6
LMHS: A SAT-IP Hybrid MaxSAT Solver
We describe LMHS, an open-source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top ofExpand
  • 41
  • 6
SAT-Based Approaches to Treewidth Computation: An Evaluation
Tree width is an important structural property of graphs, tightly connected to computational tractability in eg various constraint satisfaction formalisms such as constraint programming, BooleanExpand
  • 29
  • 6
Clause Elimination Procedures for CNF Formulas
We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedures such as tautology,Expand
  • 70
  • 5
Efficient CNF Simplification Based on Binary Implication Graphs
This paper develops techniques for efficiently detecting redundancies inCNF formulas. We introduce the concept of hidden literals, resulting in the novel technique of hidden literal elimination. WeExpand
  • 52
  • 5