Package csp.convertors

Examples of csp.convertors.FuzzyToIntegerConvertor

41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    int defaultBound = 4;
    int k = 1;

    long initTime = System.currentTimeMillis();

    FuzzyToIntegerConvertor ficonv =
        new FuzzyToIntegerConvertor(defaultBound, k);
    //ficonv.addFuzzyClause(null)
    List<FuzzyClause> clauses = RandomProblemGenerator.readConstraintsFromFile(
        new File("/home/jeroen/Doctoraat/Implementatie/godel.txt"));
    //List<FuzzyClause> clauses = RandomProblemGenerator.readConstraintsFromFile(
    //    new File("/home/jeroen/Doctoraat/Implementatie/miniontest"));

//    DoubleNegationEliminator dnegElim = new DoubleNegationEliminator();
//    ArrayList<FuzzyClause> newClauses = new ArrayList<FuzzyClause>();
//    for (FuzzyClause c : clauses) {
//      ArrayList<Literal> newLiterals = new ArrayList<Literal>();
//      for (Literal l : c.getDisjuncts()) {
//        FuzzyLiteral flit = (FuzzyLiteral) l;
//        FuzzyExpression newExp = flit.getExpression().accept(dnegElim);
//        newLiterals.add(new FuzzyLiteral(flit.getLowerBound(),
//            flit.getUpperBound(), newExp));
//      }
//      newClauses.add(new FuzzyClause(newLiterals));
//    }

    // overwrite the old clauses with the simplified ones ...
//    clauses = newClauses;

    // DEBUG output for checking DoubleNegationEliminator
    //System.out.println("After DoubleNegationEliminator");
    //for (FuzzyClause c : clauses) {
    //  System.out.println(c);
    //}

    // optimization
    HashMap trivialAssignments = new HashMap();
//    if (FiniteReductionConfig.optimizeClauses) {
//      boolean changed = true;
//      while (changed) {
////                System.out.println("...");
//        DomainFinder.simplify(clauses);
//        changed = DomainFinder.eliminateTriviallySatisfiableClauses(clauses, trivialAssignments);
//        System.out.println("Eliminated trivially satisfiable clause");
//      }
//      System.out.println("Optimized the clauses");
//    }

    //System.out.println("After optimization");
    //for (FuzzyClause c : clauses) {
    //  System.out.println(c);
    //}

    for (FuzzyClause c : clauses) {
      ficonv.addFuzzyClause(c);
    }
    //IntegerToMinionConvertor imconv = new IntegerToMinionConvertor(defaultBound);
    //MinionCSPProblem mProb = imconv.convertCSPToMinion(ficonv.convertToCSPProblem());
    TailorSolver solv = new TailorSolver("/home/jeroen/programming/tailorV0.3.2/tailor.jar",
        "/home/jeroen/programming/minion-0.10/bin/minion");
    solv.read(ficonv.convertToCSPProblem());
   
    System.out.println("Ok, read file. Now solving ...");
    solv.PPLEVELNUMBER = TailorSolver.PPLEVELNUMBER.SAC;
    solv.VARORDERNUMBER = TailorSolver.VARORDERNUMBER.LDF;
    CSPSolution solution = solv.solve();
    System.out.println("Solving ended!");
    if (solution != null) {
      solution.getSolution().putAll(trivialAssignments);
      Map<String, Double> fsol = ficonv.convertCSPSolutionToFuzzyModel(solution);
      for (String key : fsol.keySet()) {
        System.out.println(key + ": " + fsol.get(key));
      }
      if(checkModel(clauses, fsol)) {
        System.out.println("Model found!");
View Full Code Here
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
          distances);
      ArrayList<String> varOrders = createVarOrderings(townStrings, atmStrings,
          distances);
//      System.out.println(boolVars);
      //ChocoSolver solver = new ChocoSolver(10);
      FuzzyToIntegerConvertor ficonv =
          new FuzzyToIntegerConvertor(defaultBound, k);

      DoubleNegationEliminator dnegElim = new DoubleNegationEliminator();
      ArrayList<FuzzyClause> newClauses = new ArrayList<FuzzyClause>();
      for (FuzzyClause c : clauses) {
        ArrayList<Literal> newLiterals = new ArrayList<Literal>();
        for (Literal l : c.getDisjuncts()) {
          FuzzyLiteral flit = (FuzzyLiteral) l;
          FuzzyExpression newExp = flit.getExpression().accept(dnegElim);
          newLiterals.add(new FuzzyLiteral(flit.getLowerBound(),
              flit.getUpperBound(), newExp));
        }
        newClauses.add(new FuzzyClause(newLiterals));
      }

      // overwrite the old clauses with the simplified ones ...
      clauses = newClauses;

      // DEBUG output for checking DoubleNegationEliminator
      //System.out.println("After DoubleNegationEliminator");
      //for (FuzzyClause c : clauses) {
      //  System.out.println(c);
      //}

      // optimization
      //HashMap trivialAssignments = new HashMap();
      HashMap trivialAssignments = new HashMap();
      if (FiniteReductionConfig.optimizeClauses) {
        boolean changed = true;
        while (changed) {
//                System.out.println("...");
          DomainFinder.simplify(clauses);
          changed = DomainFinder.eliminateTriviallySatisfiableClauses(clauses, trivialAssignments);
          //System.out.println("Eliminated trivially satisfiable clause");
        }
        //System.out.println("Optimized the clauses");
      }

      for (FuzzyClause c : clauses) {
        ficonv.addFuzzyClause(c);
      }
      //System.out.println("Solver running...");
      //solution = solver.getModel();
      //solution = solver.getModel(varOrders);
      //System.out.println("Solver found a model");

      TailorSolver solv = new TailorSolver("/home/jeroen/programming/tailorV0.3.2/tailor.jar",
          "/home/jeroen/programming/minion-0.10/bin/minion");
      solv.read(ficonv.convertToCSPProblem());

      System.out.println("Ok, read file. Now solving ...");
      CSPSolution cspSolution = solv.solve();
      solution = ficonv.convertCSPSolutionToFuzzyModel(cspSolution);
      System.out.println("Solving ended!");

      if (solution != null) {
        solution.putAll(trivialAssignments);
        checkModel(clauses, solution);
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
    model.addConstraint(new Constraint(Constraint.Operator.GEQ,exp1,5));*/

    int defaultBound = 4;
    int k = 1;

    FuzzyToIntegerConvertor ficonv = new FuzzyToIntegerConvertor(defaultBound, k);
    //ficonv.addFuzzyClause(null)
    List<FuzzyClause> clauses = RandomProblemGenerator.readConstraintsFromFile(
        new File("/home/jeroen/Doctoraat/Implementatie/minionsmalltest.txt"));
    //List<FuzzyClause> clauses = RandomProblemGenerator.readConstraintsFromFile(
    //    new File("/home/jeroen/Doctoraat/Implementatie/miniontest"));

    DoubleNegationEliminator dnegElim = new DoubleNegationEliminator();
    ArrayList<FuzzyClause> newClauses = new ArrayList<FuzzyClause>();
    for (FuzzyClause c : clauses) {
      ArrayList<Literal> newLiterals = new ArrayList<Literal>();
      for (Literal l : c.getDisjuncts()) {
        FuzzyLiteral flit = (FuzzyLiteral) l;
        FuzzyExpression newExp = flit.getExpression().accept(dnegElim);
        newLiterals.add(new FuzzyLiteral(flit.getLowerBound(),
            flit.getUpperBound(), newExp));
      }
      newClauses.add(new FuzzyClause(newLiterals));
    }

    // overwrite the old clauses with the simplified ones ...
    clauses = newClauses;

    // DEBUG output for checking DoubleNegationEliminator
    //System.out.println("After DoubleNegationEliminator");
    //for (FuzzyClause c : clauses) {
    //  System.out.println(c);
    //}

    // optimization
    HashMap trivialAssignments = new HashMap();
    /*if (FiniteReductionConfig.optimizeClauses) {
      boolean changed = true;
      while (changed) {
//                System.out.println("...");
        DomainFinder.simplify(clauses);
        changed = DomainFinder.eliminateTriviallySatisfiableClauses(clauses, trivialAssignments);
        System.out.println("Eliminated trivially satisfiable clause");
      }
      System.out.println("Optimized the clauses");
    }*/

    //System.out.println("After optimization");
    //for (FuzzyClause c : clauses) {
    //  System.out.println(c);
    //}

    for (FuzzyClause c : clauses) {
      ficonv.addFuzzyClause(c);
    }
    IntegerToMinionConvertor imconv = new IntegerToMinionConvertor(defaultBound);
    MinionCSPProblem mProb = imconv.convertCSPToMinion(ficonv.convertToCSPProblem());
    MinionSolver solv = new MinionSolver("/home/jeroen/programming/minion-0.10/bin/minion");
    System.out.println("Reading file...");
    solv.read(mProb);
    System.out.println("Ok, read file. Now solving ...");
    CSPSolution solution = solv.solve();
    System.out.println("Solving ended!");
    if (solution != null) {
      Map<String, Double> fsol = ficonv.convertCSPSolutionToFuzzyModel(solution);
      solution.getSolution().putAll(trivialAssignments);
      checkModel(clauses, fsol);
      for (String key : fsol.keySet()) {
        System.out.println(key + ": " + fsol.get(key));
      }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
    for (FuzzyClause c : clauses) {
      System.out.println(c);
    }


    FuzzyToIntegerConvertor ficonv =
        new FuzzyToIntegerConvertor(defaultBound, k);

//    DoubleNegationEliminator dnegElim = new DoubleNegationEliminator();
//    ArrayList<FuzzyClause> newClauses = new ArrayList<FuzzyClause>();
//    for (FuzzyClause c : clauses) {
//      ArrayList<Literal> newLiterals = new ArrayList<Literal>();
//      for (Literal l : c.getDisjuncts()) {
//        FuzzyLiteral flit = (FuzzyLiteral) l;
//        FuzzyExpression newExp = flit.getExpression().accept(dnegElim);
//        newLiterals.add(new FuzzyLiteral(flit.getLowerBound(),
//            flit.getUpperBound(), newExp));
//      }
//      newClauses.add(new FuzzyClause(newLiterals));
//    }

    // overwrite the old clauses with the simplified ones ...
//    clauses = newClauses;

    HashMap trivialAssignments = new HashMap();
//    if (FiniteReductionConfig.optimizeClauses) {
//      boolean changed = true;
//      while (changed) {
//        DomainFinder.simplify(clauses);
//        changed = DomainFinder.eliminateTriviallySatisfiableClauses(clauses, trivialAssignments);
//      }
//    }

    for (FuzzyClause c : clauses) {
      ficonv.addFuzzyClause(c);
    }

    TailorSolver solv = new TailorSolver("/home/jeroen/programming/tailorV0.3.2/tailor.jar",
        "/home/jeroen/programming/minion-0.10/bin/minion");
    solv.read(ficonv.convertToCSPProblem());

    System.out.println("Ok, read file. Now solving ...");
    CSPSolution cspSolution = solv.solve();
    solution = ficonv.convertCSPSolutionToFuzzyModel(cspSolution);
    System.out.println("Solving ended!");

    if (solution != null) {
      solution.putAll(trivialAssignments);
      checkModel(clauses, solution);
View Full Code Here
TOP

Related Classes of csp.convertors.FuzzyToIntegerConvertor

  • csp.MinionTest
  • csp.TailorTest2
  • fasp.TPLPProgram
  • fasp.TPLPProgram1
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.