Examples of org.mindswap.pellet.IndividualIterator

org.mindswap.pellet.IndividualIterator
An iterator to return nodes in the order they are added. Having a separate iterator instead of using nodes.iterator() allows to change the nodes table without resetting the iteration process. @author Evren Sirin

      return false;
    return true;
  }


  private boolean processIndividuals() {
    IndividualIterator i = m_KB.getABox().getIndIterator();
    while( i.hasNext() ) {
      Individual ind = i.next();
      ATermAppl nominal = ATermUtils.makeValue( ind.getName() );
      for( ATermAppl term : ind.getTypes() ) {
        if( term.equals( nominal ) )
          continue;

View Full Code Here

          // printBlocked();
          abox.printTree();
          interpreter.alphaNet.print();
        }


        IndividualIterator i = abox.getIndIterator();


        for( TableauRule tableauRule : tableauRules ) {
          tableauRule.apply( i );
          if( abox.isClosed() )
            break;

View Full Code Here

          abox.validate();
          printBlocked();
          abox.printTree();
        }


        IndividualIterator i = (PelletOptions.USE_COMPLETION_QUEUE)
          ? abox.getCompletionQueue()
          : abox.getIndIterator();


        // flush the queue
        if( PelletOptions.USE_COMPLETION_QUEUE )

View Full Code Here

      abox.printTree();


    if( PelletOptions.USE_ADVANCED_CACHING ) {
      // if completion tree is clash free cache all sat concepts
      if( !abox.isClosed() ) {
        for( Iterator<Individual> i = new IndividualIterator( abox ); i.hasNext(); ) {
          Individual ind = i.next();
          ATermAppl c = cachedNodes.get( ind );
          if( c == null )
            continue;


          addCacheSat( c );

View Full Code Here

   * Return individuals to which we need to apply the initialization rules
   * 
   * @return
   */
  public Iterator<Individual> getInitializeIterator() {
    return new IndividualIterator(abox);
  }

View Full Code Here

    int lastIndex = name.lastIndexOf('.');
    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

          abox.validate();
          //          printBlocked();
          abox.printTree();
        }


        IndividualIterator i = abox.getIndIterator();


        for( TableauRule tableauRule : tableauRules ) {
          tableauRule.apply( i );
          if( abox.isClosed() )
            break;

View Full Code Here

          abox.validate();
          // printBlocked();
          abox.printTree();
        }


        IndividualIterator i = abox.getIndIterator();


        for( TableauRule tableauRule : tableauRules ) {
          tableauRule.apply( i );
          if( abox.isClosed() )
            break;

View Full Code Here

   * Return individuals to which we need to apply the initialization rules
   * 
   * @return
   */
  public Iterator<Individual> getInitializeIterator() {
    return new IndividualIterator(abox);
  }

View Full Code Here

    int lastIndex = name.lastIndexOf('.');
    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

TOP

Related Classes of org.mindswap.pellet.IndividualIterator

com.clarkparsia.pellet.el.ELExpressivityChecker

com.clarkparsia.pellet.rules.ContinuousRulesStrategy

com.clarkparsia.pellet.rules.RuleStrategy

org.mindswap.pellet.Individual

org.mindswap.pellet.Node

org.mindswap.pellet.tableau.completion.CompletionStrategy

org.mindswap.pellet.tableau.completion.EmptySRIQStrategy

org.mindswap.pellet.tableau.completion.SROIQStrategy

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.