Name
Abstract | ||
|---|---|---|
We observed that Conjunctive Normal Form (CNF) encodings of structured SAT instances often have a set of consecutive clauses defined over a small number of Boolean variables. To exploit the pattern, we propose a transformation of CNF to an alternative representation, Conjunctive Minterm Canonical Form (CMCF). The transformation is a two-step process: CNF clauses are first partitioned into disjoint subsets such that each subset contains CNF clauses with shared Boolean variables. CNF clauses in each subset are then replaced by Minterm Canonical Form (i.e., partial solutions), which is found by enumeration. We show empirically that a simple Stochastic Local Search (SLS) solver based on CMCF can consistently achieve a higher success rate using fewer evaluations than the SLS solver WalkSAT on two representative classes of structured SAT problems. |
Year | Venue | Field |
|---|---|---|
2016 | SOCS | WalkSAT,Discrete mathematics,Combinatorics,Disjoint sets,Satisfiability,Canonical form,Conjunctive normal form,Local search (optimization),Solver,Boolean data type,Mathematics |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenxiang Chen | 1 | 51 | 4.93 |
| L. Darrell Whitley | 2 | 6631 | 968.30 |
| Adele E. Howe | 3 | 561 | 65.70 |
| Brian W. Goldman | 4 | 185 | 11.62 |