Package org.mindswap.pellet.utils

Examples of org.mindswap.pellet.utils.Bool

652
653
654
655
656
657
658
659
660
661
662
663
  public void getObviousSubjects(ATermAppl p, ATermAppl o, CandidateSet<ATermAppl> candidates) {
    Iterator<ATermAppl> i = candidates.iterator();
    while( i.hasNext() ) {
      ATermAppl s = i.next();

      Bool hasObviousValue = hasObviousPropertyValue( s, p, o );
      if( hasObviousValue.isFalse() ) {
              i.remove();
            }
            else {
              candidates.update( s, hasObviousValue );
            }
View Full Code Here
668
669
670
671
672
673
674
675
676
    p = getRole( p ).getInverse().getName();
    Iterator<ATermAppl> i = candidates.iterator();
    while( i.hasNext() ) {
      ATermAppl s = i.next();

      Bool hasObviousValue = hasObviousObjectPropertyValue( s, p, null );
      candidates.update( s, hasObviousValue );
    }
  }
View Full Code Here
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
    if( pNode.isMerged() ) {
      isIndependent = pNode.getMergeDependency( true ).isIndependent();
      pNode = pNode.getSame();
    }

    Bool isType = isKnownType( pNode, c, subs );

    if( isIndependent ) {
          return isType;
        }
        else if( isType.isTrue() ) {
          return Bool.UNKNOWN;
        }
        else {
          return isType;
        }
View Full Code Here
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
        }
  }

  public Bool isKnownType(Individual pNode, ATermAppl concept, Collection<ATermAppl> subs) {
    // Timer t = kb.timers.startTimer( "isKnownType" );
    Bool isType = isType( pNode, concept );
    if( isType.isUnknown() ) {
      Set<ATermAppl> concepts = ATermUtils.isAnd( concept )
        ? ATermUtils.listToSet( (ATermList) concept.getArgument( 0 ) )
        : SetUtils.singleton( concept );

      isType = Bool.TRUE;
      for( ATermAppl c : concepts ) {
        Bool type = pNode.hasObviousType( c );

        if( type.isUnknown() && pNode.hasObviousType( subs ) ) {
          type = Bool.TRUE;
        }
       
        if( type.isKnown() ) {
          isType = isType.and( type );
        }
        else {
          isType = Bool.UNKNOWN;
         
//          boolean justSC = true;

          Collection<ATermAppl> axioms = kb.getTBox().getAxioms( c );
          LOOP: for( ATermAppl axiom : axioms ) {
            ATermAppl term = (ATermAppl) axiom.getArgument( 1 );

//            final AFun afun = axiom.getAFun();
//
//            if( !afun.equals( ATermUtils.SUBFUN ) ) {
//              justSC = false;
//            }

            boolean equivalent = axiom.getAFun().equals( ATermUtils.EQCLASSFUN );
            if( equivalent ) {
              Iterator<ATermAppl> i = ATermUtils.isAnd( term )
                ? new MultiListIterator( (ATermList) term.getArgument( 0 ) )
                : Collections.singleton( term ).iterator();
              Bool knownType = Bool.TRUE;
              while( i.hasNext() && knownType.isTrue() ) {
                term = i.next();
                knownType = isKnownType( pNode, term, SetUtils.<ATermAppl>emptySet() );
              }
              if( knownType.isTrue() ) {
                isType = Bool.TRUE;
                break LOOP;
              }
            }
          }
View Full Code Here
349
350
351
352
353
354
355
356
357
358
359
  protected ATermAppl createRestriction(Node node) throws UnsupportedFeatureException {
    Node restrictionType = null;
    Node p = null;
    Node filler = null;
    Node qualification = null;
    Bool isObjectRestriction = Bool.UNKNOWN;

    ClosableIterator<Triple> i = graph.find( node, null, null );
    while( i.hasNext() ) {
      monitor.incrementProgress();
View Full Code Here
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
    return isType;
  }

  private Bool isType(CachedNode pNode, ATermAppl c) {
    Bool isType = Bool.UNKNOWN;
   
    boolean isPrimitive = kb.getTBox().isPrimitive( c );
   
    if( isPrimitive && !pNode.isTop() && !pNode.isBottom() && pNode.isComplete() ) {
      DependencySet ds = pNode.getDepends().get( c );
      if( ds == null ) {
        return Bool.FALSE;
      }
      else if( ds.isIndependent() && pNode.isIndependent() ) {
        return Bool.TRUE;
      }
    }
   
    ATermAppl notC = ATermUtils.negate( c );
    CachedNode cached = getCached( notC );
    if( cached != null && cached.isComplete() ) {
      isType = cache.isMergable( kb, pNode, cached ).not();
    }

    if( PelletOptions.CHECK_NOMINAL_EDGES && isType.isUnknown() ) {
      CachedNode cNode = getCached( c );
      if( cNode != null ) {
        isType = cache.checkNominalEdges( kb, pNode, cNode ); 
      }
    }
View Full Code Here
831
832
833
834
835
836
837
838
839
840
841
842
843
      }
            else {
              subs = SetUtils.emptySet();
            }
 
      Bool type = isKnownType( x, c, subs );
      if( type.isKnown() ) {
              return type.isTrue();
            }
    }
    // List list = (List) kb.instances.get( c );
    // if( list != null )
    // return list.contains( x );
View Full Code Here
936
937
938
939
940
941
942
943
944
945
946
947
    }
        else {
          subj = subj.getSame();
        }

    Bool hasValue = subj.hasDataPropertyValue( prop, value );
    if( onlyPositive && hasValue.isFalse() ) {
          return Bool.UNKNOWN;
        }

    return hasValue;
  }
View Full Code Here
984
985
986
987
988
989
990
991
992
993
994
995
996
997
            }
    }
  }

  public boolean hasPropertyValue(ATermAppl s, ATermAppl p, ATermAppl o) {   
    Bool hasObviousValue = hasObviousPropertyValue( s, p, o );
    if( hasObviousValue.isKnown() ) {
      if( hasObviousValue.isFalse() || !doExplanation() ) {
              return hasObviousValue.isTrue();
            }
    }

    ATermAppl c = null;
    if( o == null ) {
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
    this.maxSize = maxSize;
  }
 

  private Bool checkTrivialClash(CachedNode node1, CachedNode node2) {
    Bool result = null;

    if( node1.isBottom() || node2.isBottom() ) {
      result = Bool.TRUE;
    }
    else if( node1.isTop() || node2.isTop() ) {
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.utils.Bool

  • com.clarkparsia.pellet.sparqldl.engine.QueryEngine
  • org.mindswap.pellet.ABox
  • org.mindswap.pellet.Individual
  • org.mindswap.pellet.jena.graph.loader.DefaultGraphLoader
  • org.mindswap.pellet.KnowledgeBase
  • org.mindswap.pellet.Node
  • org.mindswap.pellet.tableau.cache.AbstractConceptCache
  • org.mindswap.pellet.tableau.completion.EmptySRIQStrategy
    • 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.