Package org.mindswap.pellet.tbox

Examples of org.mindswap.pellet.tbox.TBox

321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
    Timer t = kb.timers.startTimer( "computeToldInformation" );

    toldTaxonomy = new Taxonomy<ATermAppl>( classes, ATermUtils.TOP, ATermUtils.BOTTOM );

    // compute told subsumers for each concept
    TBox tbox = kb.getTBox();
    Collection<ATermAppl> axioms = tbox.getAxioms();
    for( ATermAppl axiom : axioms ) {
      ATermAppl c1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c2 = (ATermAppl) axiom.getArgument( 1 );

      boolean equivalent = axiom.getAFun().equals( ATermUtils.EQCLASSFUN );
      Set<ATermAppl> explanation = tbox.getAxiomExplanation( axiom );

      boolean reverseArgs = !ATermUtils.isPrimitive( c1 ) && ATermUtils.isPrimitive( c2 );
      if( equivalent && reverseArgs ) {
              addToldRelation( c2, c1, equivalent, explanation );
            }
View Full Code Here
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
    /*
     * Iterate over the post-absorption unfolded class descriptions to set
     * concept flags The iteration needs to be over classes to include
     * orphans
     */
    TBox tbox = kb.getTBox();
    for( ATermAppl c : definitionOrder ) {

      Iterator<Unfolding> unfoldingList = kb.getTBox().unfold( c );

      if( !tbox.isPrimitive( c )
        || definitionOrder.isCyclic( c )
        || toldTaxonomy.getAllEquivalents( c ).size() > 1 ) {
        conceptFlags.put( c, ConceptFlag.NONPRIMITIVE );
        while( unfoldingList.hasNext() ) {
          Unfolding unf = unfoldingList.next();
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
 
  protected abstract List<ATermAppl> computeDefinitionOrder();
 
  protected void processDefinitions() {
    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 ) )
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
99
100
      }
    }
  }

  private void processClasses() {
    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
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
    Timer t = kb.timers.startTimer( "computeToldInformation" );

    toldTaxonomy = new Taxonomy<ATermAppl>( classes, ATermUtils.TOP, ATermUtils.BOTTOM );

    // compute told subsumers for each concept
    TBox tbox = kb.getTBox();
    Collection<ATermAppl> axioms = tbox.getAxioms();
    for( ATermAppl axiom : axioms ) {
      ATermAppl c1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c2 = (ATermAppl) axiom.getArgument( 1 );

      boolean equivalent = axiom.getAFun().equals( ATermUtils.EQCLASSFUN );
      Set<ATermAppl> explanation = tbox.getAxiomExplanation( axiom );

      boolean reverseArgs = !ATermUtils.isPrimitive( c1 ) && ATermUtils.isPrimitive( c2 );
      if( equivalent && reverseArgs ) {
              addToldRelation( c2, c1, equivalent, explanation );
            }
View Full Code Here
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
    /*
     * Iterate over the post-absorption unfolded class descriptions to set
     * concept flags The iteration needs to be over classes to include
     * orphans
     */
    TBox tbox = kb.getTBox();
    for( ATermAppl c : definitionOrder ) {

      Iterator<Unfolding> unfoldingList = kb.getTBox().unfold( c );

      if( !tbox.isPrimitive( c )
        || definitionOrder.isCyclic( c )
        || toldTaxonomy.getAllEquivalents( c ).size() > 1 ) {
        conceptFlags.put( c, ConceptFlag.NONPRIMITIVE );
        while( unfoldingList.hasNext() ) {
          Unfolding unf = unfoldingList.next();
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.tbox.TBox

  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker
  • 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.