Package org.mindswap.pellet

Examples of org.mindswap.pellet.Individual

547
548
549
550
551
552
553
554
555
556
557
558
559
560
      // note that we do not need to enforce the guess rule for
      // datatype properties because we may only have inverse
      // functional datatype properties which will be handled
      // inside applyPropertyRestrictions
      if (subj.isBlockable() && obj.isNominal() && !obj.isLiteral() && pred.isInverseFunctional()) {
        Individual o = (Individual) obj;
        int max = 1;
        if (!o.hasDistinctRNeighborsForMin(pred.getInverse(), max, ATermUtils.TOP, true)) {
          int guessMin = o.getMinCard(pred.getInverse(), ATermUtils.TOP);
          if (guessMin == 0) {
            guessMin = 1;
          }

          if (guessMin > max) {
View Full Code Here
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
    monitor.setProgressLength( kb.getIndividuals().size() );
    monitor.taskStarted();

    Iterator<Individual> i = kb.getABox().getIndIterator();
    for( int count = 0; i.hasNext(); count++ ) {
      Individual x = i.next();

      monitor.incrementProgress();
     
      kb.timers.getTimer( "realize" ).check();
     
      if( monitor.isCanceled() ) {
              return false;
            }

      if( log.isLoggable( Level.FINER ) ) {
              log.finer( count + ") Realizing " + format( x.getName() ) + " " );
            }

      realize(x);
    }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
    this.minGuess = minGuess;
    this.qualification = q;
  }   
   
  public IndividualBranch copyTo(ABox abox) {
      Individual x = abox.getIndividual(ind.getName());
      IndividualBranch b = new GuessBranch(abox, null, x, r, minGuess, minGuess + getTryCount() - 1, qualification, getTermDepends());
      b.setAnonCount( getAnonCount() );
      b.setNodeCount( nodeCount );
      b.setBranch( branch );
      b.setStrategy( strategy );
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
      m_Expressivity.setHasIndividual(true);
    }
   
    Iterator<Individual> i = m_KB.getABox().getIndIterator();
    while( i.hasNext() ) {
      Individual ind = i.next();
      ATermAppl nominal = ATermUtils.makeValue( ind.getName() );
      Iterator<ATermAppl> j = ind.getTypes().iterator();
      while( j.hasNext() ) {
        ATermAppl term = j.next();

        if( term.equals( nominal ) )
          continue;
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
        // importantly restore clears the clash info causing exceptions
        if( tryNext < tryCount - 1 && clashDepends.contains( getBranch() ) ) {
          AtomIObject obj = (AtomIObject) (atom instanceof UnaryAtom
            ? ((UnaryAtom) atom).getArgument()
            : ((BinaryAtom) atom).getArgument1());
          Individual ind = binding.get( obj );

          strategy.restoreLocal( ind, this );

          // global restore sets the branch number to previous
          // value so we need to
View Full Code Here
203
204
205
206
207
208
209
210
211
212
213
214
      if( result != null )
        return result;
    }

    if( bothNamedIndividuals ) {
      Individual ind1 = (Individual) root1;
      Individual ind2 = (Individual) root2;
      DependencySet ds = ind1.getDifferenceDependency( ind2 );
      if( ds != null ) {
        return ds.isIndependent()
          ? Bool.FALSE
          : Bool.UNKNOWN;
View Full Code Here
536
537
538
539
540
541
542
543
544
545
546
          neighbors = new HashSet<ATermAppl>();
          kb.getABox().getObjectPropertyValues( pNode.getName(), role, neighbors,
              neighbors, false );
        }
       
        Individual ind = kb.getABox().getIndividual( val ).getSame();
        Set<ATermAppl> samesAndMaybes = new HashSet<ATermAppl>();
        kb.getABox().getSames( ind, samesAndMaybes, samesAndMaybes );
       
        found = SetUtils.intersects( samesAndMaybes, neighbors );
      }
View Full Code Here
557
558
559
560
561
562
563
564
565
  /**
   * @param val
   * @return
   */
  private boolean isRootNominal(KnowledgeBase kb, ATermAppl val) {
    Individual ind = kb.getABox().getIndividual( val );
   
    return ind != null && ind.isRootNominal();
  }
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
    this.qualification = qualification;
        this.prevDS = new DependencySet[mergePairs.size()];
  }   
   
  public IndividualBranch copyTo(ABox abox) {
      Individual x = abox.getIndividual(ind.getName());
      MaxBranch b = new MaxBranch(abox, null, x, r, n, qualification, mergePairs, getTermDepends());
      b.setAnonCount( getAnonCount() );
      b.setNodeCount( nodeCount );
      b.setBranch( branch );
      b.setStrategy( strategy );
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
      t.stop();
    }
  }
 
  public boolean isIndirectlyBlocked(Individual blocked) {
    Individual parent = blocked.getParent();
    if( parent == null )
      return false;
    blocked.setBlocked( isBlocked( parent ) );
    return blocked.isBlocked();
  }
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.Individual

  • aterm.ATermAppl
  • com.clarkparsia.pellet.el.ELExpressivityChecker
  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker
  • com.clarkparsia.pellet.impl.SimpleIncrementalChangeTracker
  • com.clarkparsia.pellet.rules.AllNamedIndividualsIterator
  • com.clarkparsia.pellet.rules.ContinuousRulesStrategy
  • com.clarkparsia.pellet.rules.rete.AlphaFixedSubjectEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaNetwork
  • com.clarkparsia.pellet.rules.rete.AlphaNoVarEdgeNode
  • com.clarkparsia.pellet.rules.rete.AlphaTypeNode
    • 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.