Share This Author
Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming
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.
The formal underpinnings of inprocessing SAT solving are established via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques.
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 Boolean…
Blocked Clause Elimination
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.
Complexity-sensitive decision procedures for abstract argumentation
Efficient CNF Simplification Based on Binary Implication Graphs
The concept of hidden literals is introduced, resulting in the novel technique of hidden literal elimination, and it is shown that Unhiding gives performance improvements on real-world SAT competition benchmarks.
Clause Elimination for SAT and QSAT
- Marijn J. H. Heule, M. Järvisalo, Florian Lonsing, M. Seidl, Armin Biere
- Computer ScienceJ. Artif. Intell. Res.
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.
LMHS: A SAT-IP Hybrid MaxSAT Solver
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.
SAT-Based Approaches to Treewidth Computation: An Evaluation
- J. Berg, M. Järvisalo
- Computer ScienceIEEE 26th International Conference on Tools with…
- 10 November 2014
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.
Clause Elimination Procedures for CNF Formulas
This work develops and analyzes clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas, and identifies a clause elimination procedure that does a transitive reduction of the binary implication graph underlying any CNF formula purely on the CNF level.