final Node clashNode = _abox.getClash().getNode(); final List<ATermAppl> clashPath = clashNode.getPath(); clashPath.add(clashNode.getName());
final Node clashNode = _abox.getClash().getNode(); final List<ATermAppl> clashPath = clashNode.getPath(); clashPath.add(clashNode.getName());
final int lastBranch; int candidatLastBranch = _abox.getClash().getDepends().max(); while (candidatLastBranch <= 0 || candidatLastBranch > branchCount) _abox.getClash().getDepends().remove(candidatLastBranch); candidatLastBranch = _abox.getClash().getDepends().max(); _logger.severe("Used the improved backupjump."); "Backtrack: Trying to backtrack to _branch " + lastBranch// + " but has only " + branchCount + "branches."// + " Clash found: " + _abox.getClash()); if (br.getTryNext() == br.getTryCount() - 1 && _abox.getClash().getDepends().size() == 2) _abox.getKB().getDependencyIndex().addCloseBranchDependency(br, _abox.getClash().getDepends()); return false; newBranch.setLastClash(_abox.getClash().getDepends());
final int lastBranch; int candidatLastBranch = _abox.getClash().getDepends().max(); while (candidatLastBranch <= 0 || candidatLastBranch > branchCount) _abox.getClash().getDepends().remove(candidatLastBranch); candidatLastBranch = _abox.getClash().getDepends().max(); _logger.severe("Used the improved backupjump."); "Backtrack: Trying to backtrack to _branch " + lastBranch// + " but has only " + branchCount + "branches."// + " Clash found: " + _abox.getClash()); if (br.getTryNext() == br.getTryCount() - 1 && _abox.getClash().getDepends().size() == 2) _abox.getKB().getDependencyIndex().addCloseBranchDependency(br, _abox.getClash().getDepends()); return false; newBranch.setLastClash(_abox.getClash().getDepends());
public boolean tryNext() { // nothing more to try, update the clash dependency if (getTryNext() == getTryCount()) if (!_abox.isClosed()) _abox.setClash(Clash.unexplained(getNode(), _termDepends)); else _abox.getClash().setDepends(getCombinedClash()); // if there is no clash try next possibility if (!_abox.isClosed()) tryBranch(); // there is a clash so there is no point in trying this // _branch again. remove this _branch from clash dependency if (_abox.isClosed()) if (!OpenlletOptions.USE_INCREMENTAL_DELETION) _abox.getClash().getDepends().remove(getBranchIndexInABox()); return !_abox.isClosed(); }
public boolean tryNext() { // nothing more to try, update the clash dependency if (getTryNext() == getTryCount()) if (!_abox.isClosed()) _abox.setClash(Clash.unexplained(getNode(), _termDepends)); else _abox.getClash().setDepends(getCombinedClash()); // if there is no clash try next possibility if (!_abox.isClosed()) tryBranch(); // there is a clash so there is no point in trying this // _branch again. remove this _branch from clash dependency if (_abox.isClosed()) if (!OpenlletOptions.USE_INCREMENTAL_DELETION) _abox.getClash().getDepends().remove(getBranchIndexInABox()); return !_abox.isClosed(); }
_logger.fine(() -> "Clash at Branch (" + _abox.getBranchIndex() + ") " + _abox.getClash());
_logger.fine(() -> "Clash at Branch (" + _abox.getBranchIndex() + ") " + _abox.getClash());
_logger.fine("Clash at Branch (" + _abox.getBranchIndex() + ") " + _abox.getClash());
_logger.fine("Clash at Branch (" + _abox.getBranchIndex() + ") " + _abox.getClash());
System.out.println("1) Literal clash dependency = " + _abox.getClash()); return;
System.out.println("1) Literal clash dependency = " + _abox.getClash()); return;
_logger.fine("Clash at Branch (" + _abox.getBranchIndex() + ") " + _abox.getClash());
_logger.fine("Clash at Branch (" + _abox.getBranchIndex() + ") " + _abox.getClash());