Package org.mindswap.pellet

Examples of org.mindswap.pellet.Node

472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
   * @param assertion
   * @param type
   */
  private void restoreType(ATermAppl assertion, TypeDependency type) {
 
    final Node node = kb.getABox().getNode( type.getInd() );
    final ATermAppl desc = type.getType();
 
    if( DependencyIndex.log.isLoggable( Level.FINE ) ) {
      if( node instanceof Individual )
        DependencyIndex.log.fine( "    Removing type? " + desc + " from "
            + ((Individual) node).debugString() );
      else
        DependencyIndex.log.fine( "    Removing type? " + desc + " from " + node );
    }
 
    // get the dependency set - Note: we must normalize the concept
    DependencySet ds = node.getDepends( ATermUtils.normalize( desc ) );
 
    // return if null - this can happen as currently I have dupilicates in
    // the index
    if( ds == null || desc == ATermUtils.TOP )
      return;
 
    // clean it
    ds.removeExplain( assertion );
 
    // remove if the explanation set is empty
    if( ds.getExplain().isEmpty() ) {
      final IncrementalChangeTracker tracker = kb.getABox().getIncrementalChangeTracker();
 
      kb.getABox().removeType( node.getName(), desc );
 
      // update the set of removed types
      tracker.addDeletedType( node, type.getType() );
 
      // add to updated individuals
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
        }

        EdgeList edges = x.getRNeighborEdges( s );
        for( int e = 0; e < edges.size(); e++ ) {
            Edge edgeToY = edges.edgeAt( e );
            Node y = edgeToY.getNeighbor( x );
            DependencySet finalDS = ds.union( edgeToY.getDepends(), strategy.getABox().doExplanation() );
           
            if( roleChain.isEmpty() )
                applyAllValues( x, s, y, c, finalDS );
            else if(y.isIndividual()) {
                ATermAppl allRC = ATermUtils.makeAllValues( roleChain, c );

                strategy.addType( y, allRC, finalDS );
            }
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
         if( !edges.isEmpty() ) {
             ATermAppl allRC = ATermUtils.makeAllValues( chain.getNext(), c );

             for( int e = 0; e < edges.size(); e++ ) {
                 Edge edgeToY = edges.edgeAt( e );
                 Node y = edgeToY.getNeighbor( x );
                 DependencySet finalDS = ds.union( edgeToY.getDepends(), strategy.getABox().doExplanation() );
                
                 applyAllValues( x, r, y, allRC, finalDS );

                 if( x.isMerged() || strategy.getABox().isClosed() )
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
    return objectNode;
  }
 
  public boolean activate(Edge edge) {
    Individual subject = initNode();
    Node object = initObjectNode();
    EdgeDirection dir = edgeMatches(edge);
    if (dir != null && (dir == EdgeDirection.FORWARD ? edge.getFrom() : edge.getTo()).isSame(subject) && (dir == EdgeDirection.BACKWARD ? edge.getFrom() : edge.getTo()).isSame(object)) {
      activate(WME.createEdge(edge, dir));
      return true;
    }
View Full Code Here
62
63
64
65
66
67
68
69
70
    throw new UnsupportedOperationException();
  }

  public Iterator<WME> getMatches() {
    Individual subject = initNode();
    Node object = initObjectNode();
    EdgeList edges = subject.getEdgesTo(object, role);
    return toWMEs(edges, EdgeDirection.FORWARD);
  }
View Full Code Here
139
140
141
142
143
144
145
146
        return new ListIterator<Token>(memory);
    }
   
    @Override
    public Iterator<WME> getWMEs(Token token, AlphaNode alpha) {
      Node tokenArg = joinCondition.getToken().getNode(null, token);
      return alpha.getMatches(joinCondition.getWME().getIndexArg(), tokenArg);
    }
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
        return true;
    }

    @Override
    public void add(Token token) {
      Node tokenArg = joinCondition.getToken().getNode(null, token);
     
      List<Token> tokens = index.get(tokenArg);
      if (tokens == null) {
        tokens = new ArrayList<Token>();
        index.put(tokenArg, tokens);
View Full Code Here
193
194
195
196
197
198
199
200
201
202
203
      tokens.add(token);
    }
   
    @Override
    public Iterator<Token> getTokens(WME wme) {
      Node wmeArg = joinCondition.getWME().getNode(wme, null);
     
      List<Token> tokens = index.get(wmeArg);
     
      return tokens == null ? IteratorUtils.<Token>emptyIterator() : new ListIterator<Token>(tokens);
    }
View Full Code Here
202
203
204
205
206
207
208
209
      return tokens == null ? IteratorUtils.<Token>emptyIterator() : new ListIterator<Token>(tokens);
    }
   
    @Override
    public Iterator<WME> getWMEs(Token token, AlphaNode alpha) {
      Node tokenArg = joinCondition.getToken().getNode(null, token);
      return alpha.getMatches(joinCondition.getWME().getIndexArg(), tokenArg);
    }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
  public boolean hasNext() {
    if( nextIndividual != null )
      return true;

    while( nodeIterator.hasNext() ) {
      Node candidate = nodeIterator.next();
      if( (candidate instanceof Individual) && candidate.isRootNominal() ) {
        nextIndividual = (Individual) candidate;
        return true;
      }
    }
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.Node

  • aterm.ATermAppl
  • com.clarkparsia.pellet.impl.SimpleIncrementalChangeTracker
  • com.clarkparsia.pellet.rules.AllNamedIndividualsIterator
  • com.clarkparsia.pellet.rules.ContinuousRulesStrategy
  • com.clarkparsia.pellet.rules.LiteralFilter
  • com.clarkparsia.pellet.rules.rete.AlphaFixedObjectEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaNoVarEdgeNode
  • com.clarkparsia.pellet.rules.rete.BetaMemoryIndex$JoinIndexed
  • com.clarkparsia.pellet.rules.rete.BetaMemoryIndex$JoinUnindexed
  • com.clarkparsia.pellet.rules.rete.ProductionNode
    • 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.