Examples of org.mindswap.pellet.DependencySet.union()

org.mindswap.pellet.DependencySet.union()
Create a new DependencySet and all the elements of this and set . @param ds @return

            for( ATermAppl range : pred.getRanges() ) {
              if( requiredAddType( node, range ) ) {
            if( !PelletOptions.USE_TRACING )
              addType( node, range, ds.union( DependencySet.EMPTY, abox.doExplanation() ) );
            else         
              addType( node, range, ds.union( pred.getExplainRange( range ), abox.doExplanation() ) );
              }
            }


            //it could be the case that this label prevented the firing of the all values, some, or min rules of the neighbor
        subj.applyNext[Node.ALL] = 0;

View Full Code Here

            ") at branch (" + getBranch() + ") to  " + ind + 
                    " -> " + r + " -> anon" + (n == 1 ? "" : 
                    (abox.getAnonCount() + 1) + " - anon") +
                    (abox.getAnonCount() + n) + " " + ds);            


      ds = ds.union( new DependencySet( getBranch() ), abox.doExplanation() );


            // add the min cardinality restriction just to make early clash detection easier
      strategy.addType( ind, ATermUtils.makeMin(r.getName(), n, qualification), ds);
      
      // add the max cardinality for guess

View Full Code Here

      DependencySet ds = null;
      if( tryNext == tryCount - 1 && !PelletOptions.SATURATE_TABLEAU ) {
        ds = getTermDepends();


        for( int m = 0; m < tryNext; m++ )
          ds = ds.union( prevDS[m], abox.doExplanation() );


        // CHW - added for incremental reasoning and rollback through
        // deletions
        if( PelletOptions.USE_INCREMENTAL_DELETION )
          ds.setExplain( getTermDepends().getExplain() );

View Full Code Here


          setLastClash( clashDepends );
        }
        else {


          abox.setClash( Clash.unexplained( null, clashDepends.union( ds, abox
              .doExplanation() ) ) );


          // CHW - added for inc reasoning
          if( PelletOptions.USE_INCREMENTAL_DELETION )
            abox.getKB().getDependencyIndex().addCloseBranchDependency( this,

View Full Code Here

            "MAX : (" + (getTryNext()+1) + "/" + mergePairs.size() + 
            ") at branch (" + getBranch() + ") to  " + ind + 
            " for prop " + r + " qualification " + qualification + 
            " merge " + y + " -> " + z + " " + ds);            
      
      ds = ds.union(new DependencySet(getBranch()), abox.doExplanation());
      
      // max cardinality merge also depends on all the edges 
      // between the individual that has the cardinality and 
      // nodes that are going to be merged 
      EdgeList rNeighbors = ind.getRNeighborEdges(r);

View Full Code Here

      boolean yEdge = false, zEdge = false;
      for( Edge edge : rNeighbors ) {
        Node neighbor = edge.getNeighbor( ind );
        
        if( neighbor.equals( y ) ) {
          ds = ds.union( edge.getDepends(), abox.doExplanation() );
          yEdge = true;
        }
        else if( neighbor.equals( z ) ) {
          ds = ds.union( edge.getDepends(), abox.doExplanation() );
          zEdge = true;

View Full Code Here

        if( neighbor.equals( y ) ) {
          ds = ds.union( edge.getDepends(), abox.doExplanation() );
          yEdge = true;
        }
        else if( neighbor.equals( z ) ) {
          ds = ds.union( edge.getDepends(), abox.doExplanation() );
          zEdge = true;
        }
      }
      
      // if there is no edge coming into the node that is

View Full Code Here

      
      // if the neighbor nodes did not have the qualification
      // in their type list they would have not been affected
      // by the cardinality restriction. so this merges depends
      // on their types
      ds = ds.union( y.getDepends( qualification ), abox.doExplanation() );
      ds = ds.union( z.getDepends( qualification ), abox.doExplanation() );
      
            // if there were other merges based on the exact same cardinality
      // restriction then this merge depends on them, too (we wouldn't
      // have to merge these two nodes if the previous merge did not

View Full Code Here

      // if the neighbor nodes did not have the qualification
      // in their type list they would have not been affected
      // by the cardinality restriction. so this merges depends
      // on their types
      ds = ds.union( y.getDepends( qualification ), abox.doExplanation() );
      ds = ds.union( z.getDepends( qualification ), abox.doExplanation() );
      
            // if there were other merges based on the exact same cardinality
      // restriction then this merge depends on them, too (we wouldn't
      // have to merge these two nodes if the previous merge did not
      // eliminate some other possibilities)

View Full Code Here


      DependencySet ds = null;
      if(getTryNext() == getTryCount() - 1 && !PelletOptions.SATURATE_TABLEAU) {
        ds = getTermDepends();
        for(int m = 0; m < getTryNext(); m++)
          ds = ds.union(prevDS[m], abox.doExplanation());


        //CHW - added for incremental reasoning and rollback through deletions
        if(PelletOptions.USE_INCREMENTAL_DELETION)
          ds.setExplain( getTermDepends().getExplain() );
        else

View Full Code Here

0 1 2 3 4 5

TOP

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.