Name
Abstract | ||
|---|---|---|
Model rotation is an efficient technique for improving MUS finding algorithms. In previous work we have studied model rotation as an algorithm that traverses a graph which is induced by the input formula. This document introduces the notion of blocked edges, which are edges in this graph that can never be traversed. We show the existence of irredundant CNF formulas in which some clauses are unreachable by model rotation. Additionally, we proof a conjecture by Belov, Lynce and Marques-Silva. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Graph,Discrete mathematics,Combinatorics,Algorithm,Conjecture,Mathematics |
DocType | Volume | Citations |
Journal | abs/1308.2142 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siert Wieringa | 1 | 88 | 4.99 |