Package kodkod.engine.fol2sat

Examples of kodkod.engine.fol2sat.TranslationRecord.literal()

127
128
129
130
131
132
133
134
135
136
137
      for(Iterator<TranslationRecord> itr = log().replay(unitFilter); itr.hasNext(); ) {
        // it is possible that two top-level formulas have identical meaning,
        // and are represented with the same core unit; in that case, we want only
        // one of them in the core.
        final TranslationRecord rec = itr.next();
        if (seenUnits.add(rec.literal())) {
          coreRoots.put(rec.translated(), rec.node());
        } 
      }
      coreRoots = Collections.unmodifiableMap(coreRoots);
    }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
      int[] var = maxRootVar.get(record.translated());
      if (var==null) {
        var = new int[1];
        maxRootVar.put(record.translated(), var);
      }
      var[0] = StrictMath.abs(record.literal());
    }
   
    for(int[] var : maxRootVar.values()) {
      int topVar = var[0];
      if (topVar != Integer.MAX_VALUE) // formula simplified to TRUE
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
      int[] var = maxRootVar.get(record.translated());
      if (var==null) {
        var = new int[1];
        maxRootVar.put(record.translated(), var);
      }
      var[0] = StrictMath.abs(record.literal());
    }
   
    for(Map.Entry<Formula,int[]> entry : maxRootVar.entrySet()) {
      final int topVar = entry.getValue()[0];
      if (topVar != Integer.MAX_VALUE) // formula simplified to TRUE
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
        int[] val = rootLits.get(rec.translated());
        if (val==null) {
          val = new int[1];
          rootLits.put(rec.translated(), val);
        }
        val[0] = rec.literal();
        rootNodes.put(rec.translated(), rec.node());
      }
    }
   
    final SparseSequence<Formula> lits = new TreeSequence<Formula>();
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
      };
     
      constNodes = new LinkedHashMap<Formula,Boolean>();
      for(Iterator<TranslationRecord> itr = log.replay(filter); itr.hasNext(); ) {
        TranslationRecord rec = itr.next();
        int lit = rec.literal();
        if (Math.abs(lit) != Integer.MAX_VALUE) {
          constNodes.remove(rec.translated());
        } else if (lit==Integer.MAX_VALUE) {
          constNodes.put(rec.translated(), Boolean.TRUE);
        } else {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.