Package org.mindswap.pellet.tbox.impl

Examples of org.mindswap.pellet.tbox.impl.Unfolding

77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
      return;            
       
        Iterator<Unfolding> unfoldingList = strategy.getTBox().unfold( c );

        while( unfoldingList.hasNext() ) {
      Unfolding unfolding = unfoldingList.next();
          ATermAppl unfoldingCondition = unfolding.getCondition();
          DependencySet finalDS = node.getDepends( unfoldingCondition );
         
          if( finalDS == null )
            continue;
         
      Set<ATermAppl> unfoldingDS = unfolding.getExplanation(); 
          finalDS = finalDS.union( ds, strategy.getABox().doExplanation() );
          finalDS = finalDS.union( unfoldingDS, strategy.getABox().doExplanation() );
         
      ATermAppl unfoldedConcept = unfolding.getResult();           
         
            if( log.isLoggable( Level.FINE ) && !node.hasType( unfoldedConcept ) )
                log.fine( "UNF : " + node + ", " + ATermUtils.toString(c) + " -> " + ATermUtils.toString( unfoldedConcept ) + " - " + finalDS );

            strategy.addType( node, unfoldedConcept, finalDS );
View Full Code Here
421
422
423
424
425
426
427
428
429
430
431
432
      if( !tbox.isPrimitive( c )
        || definitionOrder.isCyclic( c )
        || toldTaxonomy.getAllEquivalents( c ).size() > 1 ) {
        conceptFlags.put( c, ConceptFlag.NONPRIMITIVE );
        while( unfoldingList.hasNext() ) {
          Unfolding unf = unfoldingList.next();
          for( ATermAppl d : ATermUtils.findPrimitives( unf.getResult() ) ) {
            ConceptFlag current = conceptFlags.get( d );
            if( current == null || current == ConceptFlag.COMPLETELY_DEFINED ) {
                          conceptFlags.put( d, ConceptFlag.PRIMITIVE );
                        }
          }
View Full Code Here
484
485
486
487
488
489
490
491
492
493
494
495
    markedNodes.clear();
  }

  private boolean isCDDesc(Iterator<Unfolding> unfoldingList) {   
    while( unfoldingList.hasNext() ) {
      Unfolding unf = unfoldingList.next();
      if( !isCDDesc( unf.getResult() ) ) {
              return false;
            }     
    }

    return true;
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
70
    boolean hasInverses = kb.getExpressivity().hasInverse();
    TBox tbox = kb.getTBox();
    for( ATermAppl c : kb.getClasses() ) {
      Iterator<Unfolding> unfoldingList = tbox.unfold( c );   
      while( unfoldingList.hasNext() ) {
        Unfolding unf = unfoldingList.next();
        Set<ATermAppl> usedByC = ATermUtils.findPrimitives( unf.getResult(), !hasInverses, true );
        for( ATermAppl used : usedByC ) {
          if( !kb.getClasses().contains( used ) )
            continue;
               
          addUses( c, used );
View Full Code Here
92
93
94
95
96
97
98
99
100
101
    TBox tbox = m_KB.getTBox();

    for( ATermAppl c : m_KB.getAllClasses() ) {
      Iterator<Unfolding> unfoldC = tbox.unfold( c );
      while( unfoldC.hasNext() ) {
        Unfolding unf = unfoldC.next();
        m_Visitor.visit( unf.getResult() );
      }
    }
  }
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
258
 
  private Bool checkBinaryClash(KnowledgeBase kb, ATermAppl c, CachedNode root, CachedNode otherRoot) {
        Iterator<Unfolding> unfoldingList = kb.getTBox().unfold( c );

        while( unfoldingList.hasNext() ) {
      Unfolding unfolding = unfoldingList.next();
          ATermAppl unfoldingCondition = unfolding.getCondition();
         
          if( !unfoldingCondition.equals( TOP )
            && otherRoot.getDepends().containsKey( unfoldingCondition ) ) {
            return Bool.UNKNOWN;
          }
View Full Code Here
421
422
423
424
425
426
427
428
429
430
431
432
      if( !tbox.isPrimitive( c )
        || definitionOrder.isCyclic( c )
        || toldTaxonomy.getAllEquivalents( c ).size() > 1 ) {
        conceptFlags.put( c, ConceptFlag.NONPRIMITIVE );
        while( unfoldingList.hasNext() ) {
          Unfolding unf = unfoldingList.next();
          for( ATermAppl d : ATermUtils.findPrimitives( unf.getResult() ) ) {
            ConceptFlag current = conceptFlags.get( d );
            if( current == null || current == ConceptFlag.COMPLETELY_DEFINED ) {
                          conceptFlags.put( d, ConceptFlag.PRIMITIVE );
                        }
          }
View Full Code Here
484
485
486
487
488
489
490
491
492
493
494
495
    markedNodes.clear();
  }

  private boolean isCDDesc(Iterator<Unfolding> unfoldingList) {   
    while( unfoldingList.hasNext() ) {
      Unfolding unf = unfoldingList.next();
      if( !isCDDesc( unf.getResult() ) ) {
              return false;
            }     
    }

    return true;
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
258
 
  private Bool checkBinaryClash(KnowledgeBase kb, ATermAppl c, CachedNode root, CachedNode otherRoot) {
        Iterator<Unfolding> unfoldingList = kb.getTBox().unfold( c );

        while( unfoldingList.hasNext() ) {
      Unfolding unfolding = unfoldingList.next();
          ATermAppl unfoldingCondition = unfolding.getCondition();
         
          if( !unfoldingCondition.equals( TOP )
            && otherRoot.getDepends().containsKey( unfoldingCondition ) ) {
            return Bool.UNKNOWN;
          }
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
      assertTrue( tbox.addAxiom( axiom1 ) );

      ATermAppl axiom2 = makeSub( A, B );
      assertTrue( tbox.addAxiom( axiom2 ) );

      Unfolding unfoldForAxiom2 = Unfolding.create( B, Collections.singleton( axiom2 ) );

      prepareTBox();

      /*
       * At this stage the TBox does not *directly* contain A [= B , but
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.tbox.impl.Unfolding

  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker
  • com.clarkparsia.pellet.test.tbox.TBoxTests
  • org.mindswap.pellet.tableau.cache.AbstractConceptCache
  • org.mindswap.pellet.tableau.completion.rule.UnfoldingRule
  • org.mindswap.pellet.taxonomy.AbstractDefinitionOrder
  • org.mindswap.pellet.taxonomy.CDOptimizedTaxonomyBuilder
    • 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.