Package kodkod.util.ints

Examples of kodkod.util.ints.IntSet

59
60
61
62
63
64
65
66
67
    this.bounds = bounds;
    this.usize = bounds.universe().size();
   
        //  start with the maximum partition -- the whole universe.
    this.parts = new LinkedList<IntSet>();
    final IntSet set = Ints.bestSet(usize);
    for(int i = 0; i < usize; i++) { set.add(i); }
    this.parts.add(set);
  }
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
      return;
    }
   
    final List<IntSet> otherColumns = new LinkedList<IntSet>();
    int firstColFactor = (int) StrictMath.pow(usize, arity-1);
    IntSet firstCol = Ints.bestSet(usize);
    for(IntIterator rbIter = set.iterator(); rbIter.hasNext(); ) {
      firstCol.add(rbIter.next() / firstColFactor);
    }
    refinePartitions(firstCol);
   
    int idenFactor = (1 - firstColFactor) / (1 - usize);
    for(ListIterator<IntSet> partsIter = parts.listIterator(); partsIter.hasNext(); ) {
      IntSet part = partsIter.next();
      if (firstCol.contains(part.min())) { // contains one, contains them all
        range2domain.clear();
        for(IntIterator atoms = part.iterator(); atoms.hasNext(); ) {
          int atom = atoms.next();
          IntSet atomRange = Ints.bestSet(firstColFactor);
          for(IntIterator rbIter = set.iterator(atom*firstColFactor, (atom+1)*firstColFactor - 1);
          rbIter.hasNext(); ) {
            atomRange.add(rbIter.next() % firstColFactor);
          }
          IntSet atomDomain = range2domain.get(atomRange);
          if (atomDomain != null) atomDomain.add(atom);
          else range2domain.put(atomRange, oneOf(usize, atom));
        }
        partsIter.remove();
        IntSet idenPartition = Ints.bestSet(usize);
        for(Map.Entry<IntSet, IntSet> entry : range2domain.entrySet()) {
          if (entry.getValue().size()==1 && entry.getKey().size()==1 &&
            entry.getKey().min() == entry.getValue().min() * idenFactor) {
            idenPartition.add(entry.getValue().min());
          } else {
            partsIter.add(entry.getValue());
            otherColumns.add(entry.getKey());
          }
        }
        if (!idenPartition.isEmpty())
          partsIter.add(idenPartition);     
      }
    }
   
    // refine based on the remaining columns
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
   *            (all i: [0..this.parts'.size()) |
   *             this.parts'[i].ints in set.ints || no this.parts'[i].ints & set.ints)
   */
  private void refinePartitions(IntSet set) {
    for(ListIterator<IntSet> partsIter = parts.listIterator(); partsIter.hasNext(); ) {
      IntSet part = partsIter.next();
      IntSet intersection = Ints.bestSet(part.min(), part.max());
      intersection.addAll(part);
      intersection.retainAll(set);
      if (!intersection.isEmpty() && intersection.size() < part.size()) {
        part.removeAll(intersection);
        partsIter.add(intersection);
      }
    }
  }
View Full Code Here
235
236
237
238
239
240
241
242
243
   * the given number.
   * @requries 0 <= num < size
   * @return {s: IntSet | s.ints = num }
   */
  private static final IntSet oneOf(int size, int num) {
    final IntSet set = Ints.bestSet(size);
    set.add(num);
    return set;
  }
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
   * {@inheritDoc}
   * @see kodkod.engine.satlab.ReductionStrategy#next(kodkod.engine.satlab.ResolutionTrace)
   */
  public IntSet next(ResolutionTrace trace) {
    if (varsToTry.isEmpty()) return Ints.EMPTY_SET; // tried everything
    final IntSet relevantVars = StrategyUtils.coreTailUnits(trace);
   
    for(IntIterator varItr = varsToTry.iterator(); varItr.hasNext();) {
      final int var = varItr.next();
      varItr.remove();
      if (relevantVars.remove(var)) { // remove maxVar from the set of relevant variables
        if (relevantVars.isEmpty()) break; // there was only root formula left
        // get all axioms and resolvents corresponding to the clauses that
        // form the translations of formulas identified by relevant vars
        final IntSet relevantClauses = clausesFor(trace, relevantVars);
        assert !relevantClauses.isEmpty() && !relevantClauses.contains(trace.size()-1);
        return relevantClauses;
      }
    }
   
    varsToTry.clear();   
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
   *     A = C.*T |
   *     trace.backwardReachable(A) - trace.backwardReachable(trace.axioms() - A)
   */
  private IntSet clausesFor(ResolutionTrace trace, IntSet relevantVars) {

    final IntSet relevantAxioms = StrategyUtils.clausesFor(trace, relevantVars);

    if (dist<trace.resolvents().size()) {
      IntSet relevant = relevantAxioms;
      for(int i = 0, lastSize = 0; lastSize < relevant.size() && i < dist; i++) {
        lastSize = relevant.size();
        relevant = trace.directlyLearnable(relevant);
      }
      return relevant;
    } else {
      return trace.learnable(relevantAxioms); // return all resolvents
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
  /**
   * {@inheritDoc}
   * @see kodkod.engine.satlab.ReductionStrategy#next(kodkod.engine.satlab.ResolutionTrace)
   */
  public IntSet next(final ResolutionTrace trace) {
    final IntSet core = trace.core();
    if (lastCore > core.size()) {
      lastCore = core.size();
      return core;
    } else {
      lastCore = Integer.MIN_VALUE;                 
      return Ints.EMPTY_SET;
    }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
   * @see kodkod.engine.satlab.ReductionStrategy#next(kodkod.engine.satlab.ResolutionTrace)
   */
  public IntSet next(ResolutionTrace trace) {
    if (varsToTry.isEmpty()) return Ints.EMPTY_SET; // tried everything

    final IntSet relevantVars = StrategyUtils.coreTailUnits(trace);

   
    for(IntIterator varItr = varsToTry.iterator( ); varItr.hasNext();) {
      final int var = varItr.next();
      varItr.remove();
      if (relevantVars.remove(var)) {  // remove maxVar from the set of relevant variables
        if (relevantVars.isEmpty()) break; // there was only one root formula left
        // get all axioms and resolvents corresponding to the clauses that
        // form the translations of formulas identified by relevant vars
        final IntSet relevantClauses = clausesFor(trace, relevantVars);
        assert !relevantClauses.isEmpty() && !relevantClauses.contains(trace.size()-1);
       
        if (DBG) System.out.println("relevant clauses: " + relevantClauses.size() + ", removed " + var);
       
        return relevantClauses;
      }
    }
   
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
    final double coreRatio = ((double) trace.core().size() / (double) trace.axioms().size());
   
    if (DBG) System.out.println("\ntrace size: " + trace.size() + ", axioms: " + trace.axioms().size() + ", core: " + trace.core().size() + ", resolvents: " + trace.resolvents().size());
    if (DBG) System.out.println("hardness: " + hardness + ", coreRatio: " + coreRatio);
   
    final IntSet relevantAxioms = StrategyUtils.clausesFor(trace, relevantVars);
    if (DBG) System.out.println("relevant axioms:  " + relevantAxioms.size());
   
    if (coreRatio < noRecycleRatio) {
      return relevantAxioms;
    } else if (hardness < hardnessCutOff) {
      return trace.learnable(relevantAxioms);
    } else {
      IntSet current = relevantAxioms, last;
      final int maxRelevant = (int) Math.rint(relevantAxioms.size()*recycleLimit);
      do {
        last = current;
        current = trace.directlyLearnable(current);
      } while (last.size() < current.size() && current.size() < maxRelevant);
     
      if (DBG) System.out.println("last: " + last.size() +", current: " + current.size() + ", maxRelevant: " + maxRelevant);
     
      return current.size() < maxRelevant ? current : last;
    }
       
  }
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
   * properties specified by the {@linkplain ArrayTrace#ArrayResolution(int[][], int)}
   * constructor.
   * @return the indices of the core clauses in the given trace
   */
  private static IntSet core(int[][] trace, int axioms) {
    final IntSet core = new IntBitSet(axioms);
    final IntSet reachable = new IntBitSet(trace.length);
    reachable.add(trace.length-1);
    for(int i = trace.length-1; i >= axioms; i--) {
      if (reachable.contains(i)) {
        int[] resolvent = trace[i];
        for(int j = 1, antes = resolvent[0]; j <= antes; j++) {
          reachable.add(resolvent[j]);
        }
      }
    }
   
    for(IntIterator itr = reachable.iterator(0, axioms-1); itr.hasNext(); ) {
      core.add(itr.next());
    }
   
    return core;
  }
View Full Code Here
TOP

Related Classes of kodkod.util.ints.IntSet

  • kodkod.engine.fol2sat.FOL2BoolTranslator
  • kodkod.engine.fol2sat.LeafInterpreter
  • kodkod.engine.fol2sat.SymmetryBreaker
  • kodkod.engine.fol2sat.SymmetryDetector
  • kodkod.engine.fol2sat.Translation
  • kodkod.engine.ResolutionBasedProof
  • kodkod.engine.satlab.ArrayTrace
  • kodkod.engine.satlab.LazyTrace
  • kodkod.engine.satlab.MiniSatProver
  • kodkod.engine.Solver
    • 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.