(2019) Encoding Redundancy for Satisfaction-Driven Clause Learning.
|
Text
encoding_redundancy_for_satisfaction_driven_clause_learning_heule_kiesl_biere.pdf Download (350kB) | Preview |
Abstract
Satisfaction-Driven Clause Learning (SDCL) is a recent SAT solving paradigm that aggressively trims the search space of possible truth assignments. To determine if the SAT solver is currently exploring a dispensable part of the search space, SDCL uses the so-called positive reduct of a formula: The positive reduct is an easily solvable propositional formula that is satisfiable if the current assignment of the solver can be safely pruned from the search space. In this paper, we present two novel variants of the positive reduct that allow for even more aggressive pruning. Using one of these variants allows SDCL to solve harder problems, in particular the well-known Tseitin formulas and mutilated chessboard problems. For the first time, we are able to generate and automatically check clausal proofs for large instances of these problems.
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Divisions: | Cas Cremers (CC) |
| Conference: | TACAS Tools and Algorithms for Construction and Analysis of Systems |
| Depositing User: | Benjamin Kiesl |
| Date Deposited: | 03 Jul 2019 08:43 |
| Last Modified: | 18 Jun 2020 08:32 |
| Primary Research Area: | NRA2: Reliable Security Guarantees |
| URI: | https://publications.cispa.saarland/id/eprint/2943 |
Actions
Actions (login required)
 |
View Item |