kodkod.engine.satlab
Class EmptyClauseConeStrategy

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

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

This class implements the Empty Clause Cone algorithm for reducing the size of an unsatisfiable core (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.).

Author:
Emina Torlak

Constructor Summary
EmptyClauseConeStrategy()
          Constructs a new instance of the empty clause cone strategy for minimizing unsatisfiable cores.
 
Method Summary
 java.util.Set<Clause> 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

EmptyClauseConeStrategy

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

Method Detail

next

public java.util.Set<Clause> next(ResolutionTrace trace)
Returns the next subset of clauses in the given trace to be analyzed. If there are no more subsets 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:
the next subset of clauses in the given trace to be analyzed.
See Also:
ReductionStrategy.next(kodkod.engine.satlab.ResolutionTrace)