|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use ReductionStrategy | |
---|---|
kodkod.engine | Provides classes for analyzing and evaluating Kodkod ASTs with respect to finite bounds or instances. |
kodkod.engine.satlab | Provides access to various Java and C++ SAT solvers through a common SAT Solver interface. |
kodkod.engine.ucore | Contains strategies for minimizing unsatisfiable cores generated by SAT provers. |
Uses of ReductionStrategy in kodkod.engine |
---|
Methods in kodkod.engine with parameters of type ReductionStrategy | |
---|---|
abstract void |
Proof.minimize(ReductionStrategy strategy)
Minimizes the proof of this.formula's unsatisfiability using the specified proof reduction strategy. |
Uses of ReductionStrategy in kodkod.engine.satlab |
---|
Methods in kodkod.engine.satlab with parameters of type ReductionStrategy | |
---|---|
void |
SATProver.reduce(ReductionStrategy strategy)
Uses the given reduction strategy to remove irrelevant clauses from the set of unsatisfiable clauses stored in this prover. |
Uses of ReductionStrategy in kodkod.engine.ucore |
---|
Classes in kodkod.engine.ucore that implement ReductionStrategy | |
---|---|
class |
CRRStrategy
A basic implementation of the Complete ResolutionTrace Refutation algorithm for for producing locally minimal cores. |
class |
EmptyClauseConeStrategy
A non-optimal minimization strategy based on the Empty Clause Cone algorithm. |
class |
HybridStrategy
A hybrid strategy for generating unsat cores that are minimal when mapped back onto the logic level. |
class |
MinTopStrategy
A strategy for generating unsat cores that are minimal at the logic level. |
class |
NaiveStrategy
A naive minimization strategy that tests the presence of each clause in the core by simply re-solving {core} - {clause}. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |