|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectkodkod.engine.ucore.CRRStrategy
public final class CRRStrategy
A basic implementation of the Complete ResolutionTrace Refutation algorithm for for producing locally minimal cores. An unsatisfiable core is locally minimal iff removing any single clause from the core will make the resulting formula satisfiable. No heuristic is used to pick the clauses to be excluded from the core.
traces.ResolutionTrace = nexts.Set |
all i: [1..) | some traces[i] => some traces[i-1] |
all i: [0..#nexts) | nexts[i] in traces[i].conflict.^antecedents |
no disj i,j: [0..#nexts) | traces[i] = traces[j] && nexts[i] = nexts[j] |
traces: [0..)->ResolutionTrace |
nexts: [0..)->Set |
Constructor Summary | |
---|---|
CRRStrategy()
Constructs a new instance of CRRStrategy. |
Method Summary | |
---|---|
IntSet |
next(ResolutionTrace trace)
Returns the next subset of clauses in the given trace to be analyzed. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public CRRStrategy()
no this.traces' and no this.nexts' |
Method Detail |
---|
public final IntSet next(ResolutionTrace trace)
next
in interface ReductionStrategy
{@inheritDoc} |
{@inheritDoc} |
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |