Package org.mindswap.pellet

Examples of org.mindswap.pellet.Individual

999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
    // for all edges (z, r, y) add an edge (z, r, x)
    EdgeList inEdges = y.getInEdges();
    for (int e = 0; e < inEdges.size(); e++) {
      Edge edge = inEdges.edgeAt(e);

      Individual z = edge.getFrom();
      Role r = edge.getRole();
      DependencySet finalDS = ds.union(edge.getDepends(), abox.doExplanation());

      addEdge(z, r, x, finalDS);

      // only remove the edge from z and keep a copy in y for a
      // possible restore operation in the future
      z.removeEdge(edge);

      // add to effected list
      if (abox.getBranch() >= 0 && PelletOptions.TRACK_BRANCH_EFFECTS) {
        abox.getBranchEffectTracker().add(abox.getBranch(), z.getName());
      }
    }

    x.inheritDifferents(y, ds);
View Full Code Here
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
          restoreLocal(((Individual) succ), branch, visited);
        }
      }

      for (Edge edge : ind.getInEdges()) {
        Individual pred = edge.getFrom();
        if (visited.containsKey(pred)) {
          continue;
        }
        restoreLocal(pred, branch, visited);
      }
View Full Code Here
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
  void printBlocked() {
    int blockedCount = 0;
    StringBuffer blockedNodes = new StringBuffer();
    Iterator<Individual> n = abox.getIndIterator();
    while (n.hasNext()) {
      Individual node = n.next();
      ATermAppl x = node.getName();

      if (blocking.isBlocked(node)) {
        blockedCount++;
        blockedNodes.append(x).append(" ");
      }
View Full Code Here
1245
1246
1247
1248
1249
1250
1251
1252
1253
    return name.substring(lastIndex + 1);
  }

  protected void restoreAllValues() {
    for (Iterator<Individual> i = new IndividualIterator(abox); i.hasNext();) {
      Individual ind = i.next();
      allValuesRule.apply(ind);
    }
  }
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
   * @return
   */
  public Individual next() {
    //get the next index
    findNext(-1);
    Individual ind = abox.getIndividual(queue.get(current));
    ind = ind.getSame();
    current++;
    return ind;
   
  }
View Full Code Here
176
177
178
179
180
181
182
183
184
185
   * @return
   */
  public Individual next() {
    //get the next index
    findNext(currentType);
    Individual ind = (Individual)abox.getNode(queue[currentType].get(current[currentType]));
    ind = ( Individual ) ind.getSame();
    current[currentType]++;
    return ind;   
  }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
   * {@inheritDoc}
   */
  public boolean isSafe(ATermAppl c, Individual ind) {
    Edge parentEdge = getParentEdge( ind );
    Role r = parentEdge.getRole();
    Individual parent = parentEdge.getFrom();
   
    ABox abox = parent.getABox();

    if( !isParentSafe( abox.getKB(), r, parent ) )
      return false;

    Iterator<CachedNode> nodes = getCachedNodes( abox, c );
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
  }

  protected Edge getParentEdge(Individual ind) {
    Edge result = null;
    Role role = null;
    Individual parent = ind.getParent();
    for( Edge e : ind.getInEdges() ) {
      if( e.getFrom().equals( parent ) ) {
        if( role == null ) {
          role = e.getRole();
          result = e;
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
    if (abox.isInitialized()) {

      Iterator<Individual> i = getInitializeIterator();
      while (i.hasNext()) {
        Individual n = i.next();

        if (n.isMerged()) {
          continue;
        }

        if (n.isConceptRoot()) {
          applyUniversalRestrictions(n);
        }

        allValuesRule.apply(n);
        if (n.isMerged()) {
          continue;
        }
        nominalRule.apply(n);
        if (n.isMerged()) {
          continue;
        }
        selfRule.apply(n);

        // CHW-added for inc. queue must see if this is bad
        EdgeList allEdges = n.getOutEdges();
        for (int e = 0; e < allEdges.size(); e++) {
          Edge edge = allEdges.edgeAt(e);
          if (edge.getTo().isPruned()) {
            continue;
          }

          applyPropertyRestrictions(edge);
          if (n.isMerged()) {
            break;
          }
        }

      }

      return;
    }

    if (log.isLoggable(Level.FINE)) {
      log.fine("Initialize started");
    }

    abox.setBranch(0);

    mergeList.addAll(abox.getToBeMerged());

    if (!mergeList.isEmpty()) {
      mergeAll();
    }

    Role topRole = abox.getRole(TOP_OBJECT_PROPERTY);
    Iterator<Individual> i = getInitializeIterator();
    while (i.hasNext()) {
      Individual n = i.next();

      if (n.isMerged()) {
        continue;
      }

      applyUniversalRestrictions(n);
      if (n.isMerged()) {
        continue;
      }

      selfRule.apply(n);
      if (n.isMerged()) {
        continue;
      }

      EdgeList allEdges = n.getOutEdges();
      for (int e = 0; e < allEdges.size(); e++) {
        Edge edge = allEdges.edgeAt(e);

        if (edge.getTo().isPruned()) {
          continue;
        }

        applyPropertyRestrictions(edge);

        if (n.isMerged()) {
          break;
        }
      }

      if (n.isMerged()) {
        continue;
      }

      // The top object role isn't in the edge list, so pretend it exists
      applyPropertyRestrictions(n, topRole, n, DependencySet.INDEPENDENT);
View Full Code Here
390
391
392
393
394
395
396
397
398
399
400
   *
   */
  public abstract void complete(Expressivity expr);

  public Individual createFreshIndividual(Individual parent, DependencySet ds) {
    Individual ind = abox.addFreshIndividual(parent, ds);

    applyUniversalRestrictions(ind);

    return ind;
  }
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.Individual

  • aterm.ATermAppl
  • com.clarkparsia.pellet.el.ELExpressivityChecker
  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker
  • com.clarkparsia.pellet.impl.SimpleIncrementalChangeTracker
  • com.clarkparsia.pellet.rules.AllNamedIndividualsIterator
  • com.clarkparsia.pellet.rules.ContinuousRulesStrategy
  • com.clarkparsia.pellet.rules.rete.AlphaFixedSubjectEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaNetwork
  • com.clarkparsia.pellet.rules.rete.AlphaNoVarEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaTypeNode
    • 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.