Package kodkod.engine.ucore

Contains strategies for minimizing unsatisfiable cores generated by SAT provers.

See:
          Description

Class Summary
CRRStrategy A basic implementation of the Complete ResolutionTrace Refutation algorithm for for producing locally minimal cores.
EmptyClauseConeStrategy A non-optimal minimization strategy based on the Empty Clause Cone algorithm.
HybridStrategy A hybrid strategy for generating unsat cores that are minimal when mapped back onto the logic level.
MinTopStrategy A strategy for generating unsat cores that are minimal at the logic level.
NaiveStrategy A naive minimization strategy that tests the presence of each clause in the core by simply re-solving {core} - {clause}.
StrategyUtils A collection of utility methods for implementing logic-level reduction strategies.
 

Package kodkod.engine.ucore Description

Contains strategies for minimizing unsatisfiable cores generated by SAT provers.

Package Specification

Contains implementations of various strategies for minimizing unsatisfiable cores generated by SAT provers.

Related Documentation

See Also:
ReductionStrategy, SATProver