Examples of kodkod.engine.satlab.SATMinSolver

kodkod.engine.satlab.SATMinSolver

Provides an interface to a SAT solver that produces minimal cost solutions. That is, given a CNF formula and a function f from the variables to non-negative integer, the solver produces the solution that minimizes the expression sum(f(v)*valueOf(v)) for all variables v, where valueOf(v) is 1 if the variable is set to TRUE and 0 otherwise. @specfield variables: set [1..) @specfield cost: variables -> one [0..) @specfield clauses: set Clause @invariant all i: [2..) | i in variables=> i-1 in variables @invariant all c: clauses | all lit: c.literals | lit in variables || -lit in variables @invariant all c: clauses | all disj i,j: c.literals | abs(i) != abs(j) @author Emina Torlak

    try {
      
      final Translation translation = Translator.translate(formula, bounds, options);
      final long endTransl = System.currentTimeMillis();


      final SATMinSolver cnf = (SATMinSolver)translation.cnf();
      for(Relation r : bounds.relations()) {
        IntSet vars = translation.primaryVariables(r);
        if (vars != null) {
          int rcost = cost.edgeCost(r);
          for(IntIterator iter = vars.iterator();  iter.hasNext(); ) {
            cnf.setCost(iter.next(), rcost);
          }
        }
      }
      
      options.reporter().solvingCNF(0, cnf.numberOfVariables(), cnf.numberOfClauses());
      final long startSolve = System.currentTimeMillis();
      final boolean isSat = cnf.solve();
      final long endSolve = System.currentTimeMillis();


      final Statistics stats = new Statistics(translation, endTransl - startTransl, endSolve - startSolve);
      
      return isSat ? sat(bounds, translation, stats) : unsat(translation, stats);

Examples of kodkod.engine.satlab.SATMinSolver

Related Classes of kodkod.engine.satlab.SATMinSolver