Package org.mindswap.pellet.exceptions

Examples of org.mindswap.pellet.exceptions.InternalReasonerException

249
250
251
252
253
254
255
256
257
258
   
    public boolean removeInEdge(Edge edge) {
        boolean removed = inEdges.removeEdge(edge);
       
        if( !removed ){
         throw new InternalReasonerException("Trying to remove a non-existing edge " + edge);          
        }
       
        return true;
    }
View Full Code Here
453
454
455
456
457
458
459
460
461
462
463
    return restored;
  }
 
  public void addType(ATermAppl c, DependencySet ds) {
      if( isPruned() )
          throw new InternalReasonerException( "Adding type to a pruned node " + this + " " + c );
      else if( isMerged() )
          return;
     
      // add to effected list
      if( abox.getBranch() >= 0 && PelletOptions.TRACK_BRANCH_EFFECTS ) {
View Full Code Here
40
41
42
43
44
45
46
    this.abox = abox;
  }
 
  private void argCheck(Number[] args) {
    if ( args.length != 1 )
      throw new InternalReasonerException( "Wrong number of arguments to visitor." );
  }
View Full Code Here
228
229
230
231
232
233
234
235
236
    d.accept( visitor );

    ATermAppl a = visitor.result();

    if( a == null )
      throw new InternalReasonerException( "Cannot create ATerm from description " + d );
   
    return a;
  }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
      // not more branches to try
      if( lastBranch <= 0 )
        return false;
      else if( lastBranch > abox.getBranches().size() )
        throw new InternalReasonerException( "Backtrack: Trying to backtrack to branch "
            + lastBranch + " but has only " + abox.getBranches().size()
            + " branches. Clash found: " + abox.getClash() );
      else if( PelletOptions.USE_INCREMENTAL_DELETION ) {
        // get the last branch
        Branch br = abox.getBranches().get( lastBranch - 1 );

        // if this is the last disjunction, merge pair, etc. for the
        // branch (i.e, br.tryNext == br.tryCount-1) and there are no
        // other branches to test (ie.
        // abox.getClash().depends.size()==2),
        // then update depedency index and return false
        if( (br.getTryNext() == br.getTryCount() - 1)
            && abox.getClash().getDepends().size() == 2 ) {
          abox.getKB().getDependencyIndex().addCloseBranchDependency( br,
              abox.getClash().getDepends() );
          return false;
        }
      }

      List<Branch> branches = abox.getBranches();
      abox.stats.backjumps += (branches.size() - lastBranch);
      // CHW - added for incremental deletion support
      if( PelletOptions.USE_TRACING && PelletOptions.USE_INCREMENTAL_CONSISTENCY ) {
        // we must clean up the KB dependecny index
        List<Branch> brList = branches.subList( lastBranch, branches.size() );
        for( Iterator<Branch> it = brList.iterator(); it.hasNext(); ) {
          // remove from the dependency index
          abox.getKB().getDependencyIndex().removeBranchDependencies( it.next() );
        }
        brList.clear();
      }
      else {
        // old approach
        branches.subList( lastBranch, branches.size() ).clear();
      }

      // get the branch to try
      Branch newBranch = branches.get( lastBranch - 1 );

      if( log.isLoggable( Level.FINE ) )
        log.fine( "JUMP: Branch " + lastBranch );

      if( lastBranch != newBranch.getBranch() )
        throw new InternalReasonerException( "Backtrack: Trying to backtrack to branch "
            + lastBranch + " but got " + newBranch.getBranch() );

      // set the last clash before restore
      if( newBranch.getTryNext() < newBranch.getTryCount() ) {
        newBranch.setLastClash( abox.getClash().getDepends() );
View Full Code Here
875
876
877
878
879
880
881
882
883
884
885
      }
      else if (y instanceof Individual && z instanceof Individual) {
        mergeIndividuals((Individual) y, (Individual) z, ds);
      }
      else {
        throw new InternalReasonerException("Invalid merge operation!");
      }
    }

    merging = false;
    mergeAll();
View Full Code Here
992
993
994
995
996
997
998
999
1000
    d.accept( visitor );

    ATermAppl a = visitor.result();

    if( a == null )
      throw new InternalReasonerException( "Cannot create ATerm from description " + d );

    return a;
  }
View Full Code Here
107
108
109
110
111
112
113
114
        }
        else if(af.equals(ATermUtils.RESTRDATATYPEFUN)) {
          visitRestrictedDatatype(term);
        }
    else {
        throw new InternalReasonerException("Invalid term " + term);       
    }
  }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
      return;
 
    TaxonomyNode<ATermAppl> cNode = definitionOrderTaxonomy.getNode( c );
    TaxonomyNode<ATermAppl> dNode = definitionOrderTaxonomy.getNode( d );
    if( cNode == null )
      throw new InternalReasonerException( c + " is not in the definition order" );
    else if( cNode.equals( definitionOrderTaxonomy.getTop() ) )
      definitionOrderTaxonomy.merge( cNode, dNode );
    else {
      definitionOrderTaxonomy.addSuper( c, d );
      definitionOrderTaxonomy.removeCycles( cNode );
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
        + " not in taxonomy";

    TaxonomyNode<T> subNode = nodes.get( sub );
    TaxonomyNode<T> supNode = nodes.get( sup );
    if( subNode.equals( supNode ) )
      throw new InternalReasonerException(
          "Equivalent elements cannot have sub/super relationship" );

    if( subNode.getSupers().size() == 1 && subNode.getSupers().iterator().next() == topNode )
      topNode.removeSub( subNode );
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.exceptions.InternalReasonerException

  • com.clarkparsia.pellet.el.ELSyntaxUtils
  • com.clarkparsia.pellet.expressivity.DLExpressivityChecker$Visitor
  • com.clarkparsia.pellet.owlapiv3.AxiomConverter
  • com.clarkparsia.pellet.owlapiv3.ConceptConverter
  • com.clarkparsia.pellet.owlapiv3.PelletLoader
  • com.clarkparsia.pellet.owlapiv3.PelletReasoner
  • com.clarkparsia.pellet.rules.builtins.GeneralFunctionBuiltIn$GeneralFunctionHelper
  • com.clarkparsia.pellet.rules.builtins.NumberToLiteralVisitor
  • com.clarkparsia.pellet.rules.builtins.NumericComparisonVisitor
  • com.clarkparsia.pellet.rules.builtins.NumericPromotion
    • 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.