kodkod.engine.ucore
Class EmptyClauseConeStrategy

java.lang.Object
  extended by kodkod.engine.ucore.EmptyClauseConeStrategy
All Implemented Interfaces:
ReductionStrategy

public final class EmptyClauseConeStrategy
extends java.lang.Object
implements ReductionStrategy

A non-optimal minimization strategy based on the Empty Clause Cone algorithm.

Author:
Emina Torlak
See Also:
L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In Proceedings of Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT '03). 2003.

Constructor Summary
EmptyClauseConeStrategy()
          Constructs a new instance of the empty clause cone strategy for minimizing unsatisfiable cores.
 
Method Summary
 IntSet next(ResolutionTrace trace)
          Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace.
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

EmptyClauseConeStrategy

public EmptyClauseConeStrategy()
Constructs a new instance of the empty clause cone strategy for minimizing unsatisfiable cores.

Method Detail

next

public IntSet next(ResolutionTrace trace)
Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace. If there are no more subtraces to be analyzed (i.e. the given trace is minimal according to the minimality measure used by this strategy), returns the empty set.

Specified by:
next in interface ReductionStrategy
Returns:
this.nexts'[#this.nexts-1]
See Also:
ReductionStrategy.next(kodkod.engine.satlab.ResolutionTrace)