Examples of kodkod.engine.ucore.RCEStrategy

kodkod.engine.ucore.RCEStrategy

Recycling Core Extraction is a strategy for generating unsat cores that are minimal at the logic level. Specifically, let C be a core that is minimal according to this strategy, and let F(C) be the top-level logic constraints corresponding to C. Then, this strategy guarantees that there is no clause c in C such that F(C - c) is a strict subset of F(C). Furthermore, it also guarantees that for all f in F(C), F(C) - f is satisfiable. This is a stronger guarantee than that of {@linkplain HybridStrategy}. In general, using this strategy is more expensive, timewise, than using {@linkplain HybridStrategy}.

This implementation of RCE will work properly only on CNFs generated by the kodkod {@linkplain Translator}.

@author Emina Torlak @see HybridStrategy

              Proof p = sol.proof();
              if (sol.outcome()==UNSATISFIABLE) {
                 // only perform the minimization if it was UNSATISFIABLE, rather than TRIVIALLY_UNSATISFIABLE
                 int i = p.highLevelCore().size();
                 rep.minimizing(cmd, i);
                 if (opt.coreMinimization==0) try { p.minimize(new RCEStrategy(p.log())); } catch(Throwable ex) {}
                 if (opt.coreMinimization==1) try { p.minimize(new HybridStrategy(p.log())); } catch(Throwable ex) {}
                 rep.minimized(cmd, i, p.highLevelCore().size());
              }
              for(Iterator<TranslationRecord> it=p.core(); it.hasNext();) {
                 Object n=it.next().node();

Examples of kodkod.engine.ucore.RCEStrategy

Related Classes of kodkod.engine.ucore.RCEStrategy