Package org.mindswap.pellet

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

97
98
99
100
101
102
103
104
105
106
107
            disj = new HashSet<Literal>();
            ne.put( l, disj );
            nePresent = true;
          }
          disj.add( k );
          ds = ds.union( l.getDifferenceDependency( n ), strategy.getABox().doExplanation() );
        }
        else {
          throw new IllegalStateException();
        }
      }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
    if( nePresent ) {
      try {
        if( !strategy.getABox().getDatatypeReasoner().isSatisfiable( nodes, ne ) ) {
          for( Node n : nodes ) {
            for( DependencySet typeDep : n.getDepends().values() )
              ds = ds.union( typeDep, strategy.getABox().doExplanation() );
          }
          /*
           * TODO: More descriptive clash
           */
          strategy.getABox().setClash( Clash.unexplained( ind, ds ) );
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
            + e.getMessage();
        if( PelletOptions.INVALID_LITERAL_AS_INCONSISTENCY ) {
          log.fine( msg );
          for( Node n : nodes ) {
            for( DependencySet typeDep : n.getDepends().values() )
              ds = ds.union( typeDep, strategy.getABox().doExplanation() );
          }
          strategy.getABox().setClash( Clash.invalidLiteral( ind, ds ) );
        }
        else {
          log.severe( msg );
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
            Node succ = y[c1];
            DependencySet finalDS = ds;

            strategy.addEdge( x, r, succ, ds );
            if( succ.isPruned() ) {
                finalDS = finalDS.union( succ.getMergeDependency( true ), strategy.getABox().doExplanation() );
                succ = succ.getMergedTo();
            }

            strategy.addType( succ, c, finalDS );
            for( int c2 = 0; c2 < c1; c2++ )
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
                    return;
                }

                if( hasMore ) {
                    // subsequent merges depend on the previous merge
                    ds = ds.union( new DependencySet( strategy.getABox().getBranches().size() ), strategy.getABox().doExplanation() );
                }
            }
        }  
    }
   
View Full Code Here
223
224
225
226
227
228
229
230
231
232
233
            Node y = nodes.get( i );
            for( int j = i + 1; j < nodes.size(); j++ ) {
                Node x = nodes.get( j );

                if( y.isDifferent( x ) ) {
                  ds = ds.union( y.getDifferenceDependency( x ), strategy.getABox().doExplanation() );
                    continue;
                }

                // 1. if x is a nominal node (of lower level), then Merge(y, x)
                if( x.getNominalLevel() < y.getNominalLevel() )
View Full Code Here
204
205
206
207
208
209
210
211
212
213
214
              continue;
            }

            if( pred.isSubRoleOf( s ) ) {
                DependencySet finalDS = subj.getDepends( av );
        finalDS = finalDS.union( ds, strategy.getABox().doExplanation() );
        finalDS = finalDS.union( s.getExplainSubOrInv( pred ), strategy.getABox().doExplanation() );
                if( roleChain.isEmpty() )
                    applyAllValues( subj, s, obj, c, finalDS );
                else if (obj.isIndividual()) {
                    ATermAppl allRC = ATermUtils.makeAllValues( roleChain, c );
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
            }

            if( pred.isSubRoleOf( s ) ) {
                DependencySet finalDS = subj.getDepends( av );
        finalDS = finalDS.union( ds, strategy.getABox().doExplanation() );
        finalDS = finalDS.union( s.getExplainSubOrInv( pred ), strategy.getABox().doExplanation() );
                if( roleChain.isEmpty() )
                    applyAllValues( subj, s, obj, c, finalDS );
                else if (obj.isIndividual()) {
                    ATermAppl allRC = ATermUtils.makeAllValues( roleChain, c );
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
                    if( !pred.isSubRoleOf( firstRole ) )
                        continue;

                    ATermAppl allRC = ATermUtils.makeAllValues( chain.getNext(), c );

                    applyAllValues( subj, pred, obj, allRC, finalDS.union(
                        firstRole.getExplainSub(pred.getName()), strategy.getABox().doExplanation()).union(
                            s.getExplainSub(chain), strategy.getABox().doExplanation() ) );

                    if( subj.isMerged() || strategy.getABox().isClosed() )
                        return;
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
      DependencySet ds = x.getDepends( allDesc );
      if (existing == null) {
        existing = new ArrayList<ATermAppl>();
        dataranges.put( r, existing );
      } else {
        ds = ds.union( rangeDepends.get( r ), strategy.getABox().doExplanation() );
      }
      existing.add( (ATermAppl) allDesc.getArgument(1) );
      rangeDepends.put( r, 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.