Package org.mindswap.pellet

Examples of org.mindswap.pellet.Role

264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
  private Bool checkAllValuesClash(KnowledgeBase kb, ATermAppl av, CachedNode root,
      CachedNode otherRoot) {
    ATerm r = av.getArgument( 0 );
    if( r.getType() == ATerm.LIST )
      r = ((ATermList) r).getFirst();
    Role role = kb.getRole( r );

    if( !role.hasComplexSubRole() ) {
      if( otherRoot.hasRNeighbor( role ) ) {
        if( log.isLoggable( Level.FINE ) )
          log
              .fine( root + " has " + av + " " + otherRoot + " has " + role
                  + " neighbor" );

        return Bool.UNKNOWN;
      }
    }
    else {
      TransitionGraph<Role> tg = role.getFSM();
      for( Transition<Role> t : tg.getInitialState().getTransitions() ) {
        if( otherRoot.hasRNeighbor( t.getName() ) ) {
          if( log.isLoggable( Level.FINE ) )
            log.fine( root + " has " + av + " " + otherRoot + " has " + t.getName()
                + " neighbor" );
View Full Code Here
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
      visitMax( term );
    }

    public void visitMin(ATermAppl term) {
      visitRole( (ATermAppl) term.getArgument( 0 ) );
      Role role = m_KB.getRole( term.getArgument( 0 ) );
      ATermAppl c = (ATermAppl) term.getArgument( 2 );
      if( !ATermUtils.isTop( c ) ) {
        if( role.isDatatypeRole() )
          m_Expressivity.setHasCardinalityD(true);
        else
          m_Expressivity.setHasCardinalityQ(true);
      }
      else {
        if( role.isDatatypeRole() )
          m_Expressivity.setHasCardinalityD(true);
        else
          m_Expressivity.setHasCardinality(true);
      }
    }
View Full Code Here
295
296
297
298
299
300
301
302
303
304
305
  }

  private Bool checkMaxClash(KnowledgeBase kb, ATermAppl mc, CachedNode root, CachedNode otherRoot) {
    ATermAppl maxCard = (ATermAppl) mc.getArgument( 0 );

    Role maxR = kb.getRole( maxCard.getArgument( 0 ) );
    int max = ((ATermInt) maxCard.getArgument( 1 )).getInt() - 1;

    int n1 = getRNeighbors( root, maxR ).size();
    int n2 = getRNeighbors( otherRoot, maxR ).size();
View Full Code Here
311
312
313
314
315
316
317
318
319
320
321
    return null;
  }

  private Bool checkSelfClash(KnowledgeBase kb, ATermAppl self, CachedNode root, CachedNode otherRoot) {
    Role r = kb.getRole( self.getArgument( 0 ) );
   
    for( Edge e : otherRoot.getOutEdges() ) {
      if( e.getRole().isSubRoleOf( r ) && e.getToName().equals( otherRoot.getName() ) ) {
        if( log.isLoggable( Level.FINE ) )
          log.fine( root + " has not(" + self + ") " + otherRoot + " has self edge" );
View Full Code Here
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
      }
    }

    public void visitMax(ATermAppl term) {
      visitRole( (ATermAppl) term.getArgument( 0 ) );
      Role role = m_KB.getRole( term.getArgument( 0 ) );
      int cardinality = ((ATermInt) term.getArgument( 1 )).getInt();
      ATermAppl c = (ATermAppl) term.getArgument( 2 );
      if( !ATermUtils.isTop( c ) ) {
        if( role.isDatatypeRole() )
          m_Expressivity.setHasCardinalityD(true);
        else       
          m_Expressivity.setHasCardinalityQ(true);
      }
      else if( cardinality > 1 ) {
        if( role.isDatatypeRole() )
          m_Expressivity.setHasCardinalityD(true);
        else
          m_Expressivity.setHasCardinality(true);
      }
    }
View Full Code Here
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
  }
 
  private Bool checkFunctionalityClash(CachedNode root, CachedNode otherRoot) {
    Set<Role> checked = new HashSet<Role>();
    for( Edge edge : root.getOutEdges() ) {
      Role role = edge.getRole();

      if( !role.isFunctional() )
        continue;

      Set<Role> functionalSupers = role.getFunctionalSupers();
      for( Iterator<Role> j = functionalSupers.iterator(); j.hasNext(); ) {
        Role supRole = j.next();

        if( checked.contains( supRole ) )
          continue;

        checked.add( supRole );

        if( otherRoot.hasRNeighbor( supRole ) ) {
          if( log.isLoggable( Level.FINE ) )
            log.fine( root + " and " + otherRoot + " has " + supRole );
          return Bool.UNKNOWN;
        }
      }
    }

    for( Edge edge : root.getInEdges() ) {
      Role role = edge.getRole().getInverse();

      if( role == null || !role.isFunctional() )
        continue;

      Set<Role> functionalSupers = role.getFunctionalSupers();
      for( Iterator<Role> j = functionalSupers.iterator(); j.hasNext(); ) {
        Role supRole = j.next();

        if( checked.contains( supRole ) )
          continue;

        checked.add( supRole );
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
  }
 
  private Bool checkFunctionalityClashWithDifferents(Individual root, Individual otherRoot) {
    Bool result = null;
    for( Edge edge : root.getOutEdges() ) {
      Role role = edge.getRole();

      if( !role.isFunctional() )
        continue;

      Set<Role> functionalSupers = role.getFunctionalSupers();
      for( Iterator<Role> j = functionalSupers.iterator(); j.hasNext(); ) {
        Role supRole = j.next();

        EdgeList otherEdges = otherRoot.getRNeighborEdges( supRole );
        for( Edge otherEdge : otherEdges ) {
          DependencySet ds = edge.getTo().getDifferenceDependency( otherEdge.getNeighbor( otherRoot ) );
          if( log.isLoggable( Level.FINE ) )
            log.fine( root + " and " + otherRoot + " has " + supRole + " " + edge + " " + otherEdge );
          if( ds != null && ds.isIndependent() )
            return Bool.FALSE;
          result = Bool.UNKNOWN;
        }
      }
    }

    for( Edge edge : root.getInEdges() ) {
      Role role = edge.getRole().getInverse();

      if( role == null || !role.isFunctional() )
        continue;

      Set<Role> functionalSupers = role.getFunctionalSupers();
      for( Iterator<Role> j = functionalSupers.iterator(); j.hasNext(); ) {
        Role supRole = j.next();

        EdgeList otherEdges = otherRoot.getRNeighborEdges( supRole );
        for( Edge otherEdge : otherEdges ) {
          DependencySet ds = edge.getTo().getDifferenceDependency( otherEdge.getNeighbor( otherRoot ) );
          if( log.isLoggable( Level.FINE ) )
View Full Code Here
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
  }
 
  private MultiValueMap<ATermAppl, Role> collectNeighbors(CachedNode ind) {
    MultiValueMap<ATermAppl, Role> neighbors = new MultiValueMap<ATermAppl, Role>();
    for( Edge edge : ind.getInEdges() ) {
      Role role = edge.getRole();
      ATermAppl neighbor = edge.getFromName();

      if( !ATermUtils.isBnode( neighbor ) )
        neighbors.putSingle( neighbor, role );
    }
   
    for( Edge edge : ind.getOutEdges() ) {
      Role role = edge.getRole();
      ATermAppl neighbor = edge.getToName();
      if( role.isObjectRole() && !ATermUtils.isBnode( neighbor ) )
        neighbors.putSingle( neighbor, role.getInverse() );
    }
    return neighbors;
  }
View Full Code Here
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
      boolean checkInverses) {
    EdgeList edges = checkInverses
      ? cNode.getInEdges()
      : cNode.getOutEdges();
    for( Edge edge : edges ) {
      Role role = checkInverses
        ? edge.getRole().getInverse()
        : edge.getRole();
      DependencySet ds = edge.getDepends();

      if( !ds.isIndependent() )
        continue;

      boolean found = false;
      ATermAppl val = checkInverses
        ? edge.getFromName()
        : edge.getToName();

      if( !role.isObjectRole() ) {
        found = pNode.hasRNeighbor( role );
      }
      else if( !isRootNominal( kb, val ) ) {
        if( !role.hasComplexSubRole() )
          found = pNode.hasRNeighbor( role );
        else {
          TransitionGraph<Role> tg = role.getFSM();
          Iterator<Transition<Role>> it = tg.getInitialState().getTransitions().iterator();
          while( !found && it.hasNext() ) {
            Transition<Role> tr = it.next();
            found = pNode.hasRNeighbor( tr.getName() );
          }
        }
      }
      else {
        Set<ATermAppl> neighbors = null;

        if( role.isSimple() || !(pNode instanceof Individual) )
          neighbors = getRNeighbors( pNode, role );
        else {
          neighbors = new HashSet<ATermAppl>();
          kb.getABox().getObjectPropertyValues( pNode.getName(), role, neighbors,
              neighbors, false );
View Full Code Here
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
   */
  private Set<ATermAppl> getRNeighbors(CachedNode node, Role role) {
    Set<ATermAppl> neighbors = new HashSet<ATermAppl>();

    for( Edge edge : node.getOutEdges() ) {
      Role r = edge.getRole();
      if( r.isSubRoleOf( role ) ) {
        neighbors.add( edge.getToName() );
      }
    }

    if( role.isObjectRole() ) {
      role = role.getInverse();
      for( Edge edge : node.getInEdges() ) {
        Role r = edge.getRole();
        if( r.isSubRoleOf( role ) ) {
          neighbors.add( edge.getFromName() );
        }
      }
    }

View Full Code Here
TOP

Related Classes of org.mindswap.pellet.Role

  • aterm.ATermList
  • com.clarkparsia.pellet.el.RoleChainCache
  • com.clarkparsia.pellet.el.SimplifiedELClassifier
  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker$Visitor
  • com.clarkparsia.pellet.owlapiv3.PelletVisitor
  • com.clarkparsia.pellet.rules.ContinuousRulesStrategy
  • com.clarkparsia.pellet.rules.rete.AlphaEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaNetwork
  • com.clarkparsia.pellet.rules.rete.AlphaNetwork$AlphaNodeCreator
  • com.clarkparsia.pellet.rules.rete.Compiler
    • 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.