Package org.mindswap.pellet

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

124
125
126
127
128
129
130
131
132
133
134
            "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
135
136
137
138
139
140
141
142
143
144
145
      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
139
140
141
142
143
144
145
146
147
148
149
        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
156
157
158
159
160
161
162
163
164
165
166
     
      // 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
157
158
159
160
161
162
163
164
165
166
167
      // 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
805
806
807
808
809
810
811
812
813
814
815
      Node y = abox.getNode(merge.getSource());
      Node z = abox.getNode(merge.getTarget());
      DependencySet ds = merge.getDepends();

      if (y.isMerged()) {
        ds = ds.union(y.getMergeDependency(true), abox.doExplanation());
        y = y.getSame();
      }

      if (z.isMerged()) {
        ds = ds.union(z.getMergeDependency(true), abox.doExplanation());
View Full Code Here
810
811
812
813
814
815
816
817
818
819
820
        ds = ds.union(y.getMergeDependency(true), abox.doExplanation());
        y = y.getSame();
      }

      if (z.isMerged()) {
        ds = ds.union(z.getMergeDependency(true), abox.doExplanation());
        z = z.getSame();
      }

      if (y.isPruned() || z.isPruned()) {
        continue;
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
    @Override
      public DependencySet getDepends(boolean doExplanation) {
      DependencySet ds = DependencySet.INDEPENDENT;
     
      for (ListToken t = this; t != null; t = t.next) {         
              ds = ds.union(t.wme.getDepends(), doExplanation );
      }   
     
      return ds;
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
    @Override
      public DependencySet getDepends(boolean doExplanation) {
      DependencySet ds = DependencySet.INDEPENDENT;
     
      for (WME wme : wmes) {         
              ds = ds.union(wme.getDepends(), doExplanation );
      }   
     
      return ds;
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.