Examples of tryNext()

Examples of org.mindswap.pellet.tableau.branch.Branch.tryNext()

277
278
279
280
281
282
283
284
285
286
287
            if( unexploredBranch.getTryNext() < unexploredBranch.getTryCount() ) {
              restore( unexploredBranch );
              System.out.println( "restoring branch " + unexploredBranch.getBranch()
                  + " tryNext = " + unexploredBranch.getTryNext()
                  + " tryCount = " + unexploredBranch.getTryCount() );
              unexploredBranch.tryNext();
              break;
            }
            else {
              System.out.println( "removing branch " + unexploredBranch.getBranch() );
              abox.getBranches().remove( i );
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.Branch.tryNext()

114
115
116
117
118
119
120
121
122
123
124
        // undo the changes done after this branch
        restore( newBranch );
      }

      // try the next possibility
      branchFound = newBranch.tryNext();

      if( !branchFound ) {
        if( log.isLoggable( Level.FINE ) )
          log.fine( "FAIL: Branch " + lastBranch );
      }
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.Branch.tryNext()

196
197
198
199
200
201
202
203
204
205
206
            if( unexploredBranch.getTryNext() < unexploredBranch.getTryCount() ) {
              restore( unexploredBranch );
              System.out.println( "restoring branch " + unexploredBranch.getBranch()
                  + " tryNext = " + unexploredBranch.getTryNext()
                  + " tryCount = " + unexploredBranch.getTryCount() );
              unexploredBranch.tryNext();
              break;
            }
            else {
              System.out.println( "removing branch " + unexploredBranch.getBranch() );
              abox.getBranches().remove( i );
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.Branch.tryNext()

572
573
574
575
576
577
578
579
580
581
582
        newBranch.setTryNext( newBranch.getTryNext() + 1 );

        if( newBranch.getTryNext() < newBranch.getTryCount() ) {
          restore( newBranch );

          branchFound = newBranch.tryNext();
        }
      }

      if( !branchFound ) {
        abox.getClash().getDepends().remove( lastBranch );
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.Branch.tryNext()

212
213
214
215
216
217
218
219
220
221
222
            if( unexploredBranch.getTryNext() < unexploredBranch.getTryCount() ) {
              restore( unexploredBranch );
              System.out.println( "restoring branch " + unexploredBranch.getBranch()
                  + " tryNext = " + unexploredBranch.getTryNext() + " tryCount = "
                  + unexploredBranch.getTryCount() );
              unexploredBranch.tryNext();
              break;
            }
            else {
              System.out.println( "removing branch " + unexploredBranch.getBranch() );
              abox.getBranches().remove( i );
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.Branch.tryNext()

355
356
357
358
359
360
361
362
363
364
365
            if( unexploredBranch.getTryNext() < unexploredBranch.getTryCount() ) {
              restore( unexploredBranch );
              System.out.println( "restoring branch " + unexploredBranch.getBranch()
                  + " tryNext = " + unexploredBranch.getTryNext()
                  + " tryCount = " + unexploredBranch.getTryCount() );
              unexploredBranch.tryNext();
              break;
            }
            else {
              System.out.println( "removing branch " + unexploredBranch.getBranch() );
              abox.getBranches().remove( i );
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.ChooseBranch.tryNext()

77
78
79
80
81
82
83
84
85
86
87
            if( !neighbor.hasType( c ) && !neighbor.hasType( ATermUtils.negate( c ) ) ) {
                ChooseBranch newBranch = new ChooseBranch( strategy.getABox(), strategy, neighbor, c, x
                    .getDepends( maxCard ) );
                strategy.addBranch( newBranch );

                newBranch.tryNext();

                if( strategy.getABox().isClosed() )
                    return;
            }
        }     
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.DisjunctionBranch.tryNext()

103
104
105
106
107
108
109
110
111
    DisjunctionBranch newBranch = new DisjunctionBranch( strategy.getABox(), strategy, node,
        disjunction, node.getDepends( disjunction ), disj );
    strategy.addBranch( newBranch );

    newBranch.tryNext();
  }

}
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.GuessBranch.tryNext()

117
118
119
120
121
122
123
124
    }

    GuessBranch newBranch = new GuessBranch(strategy.getABox(), strategy, x, r, guessMin, n, c, ds);
    strategy.addBranch(newBranch);

    newBranch.tryNext();
  }
}
View Full Code Here

Examples of org.mindswap.pellet.tableau.branch.GuessBranch.tryNext()

564
565
566
567
568
569
570
571
572
573
574
          GuessBranch newBranch = new GuessBranch(abox, this, o, pred.getInverse(), guessMin, max,
                          ATermUtils.TOP, ds);
          addBranch(newBranch);

          // try a merge that does not trivially fail
          if (newBranch.tryNext() == false) {
            return edge;
          }

          if (abox.isClosed()) {
            return edge;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.