private void findNext() { for (; _index < _stop; _index++) { final Node node = _abox.getNode(_nodeList.get(_index)); if (!node.isPruned() && node.isIndividual()) break; } }
private void findNext() { for (; _index < _stop; _index++) { final Node node = _abox.getNode(_nodeList.get(_index)); if (!node.isPruned() && node.isIndividual()) break; } }
public Stream<Individual> nodes() { return new ArrayList<>(_nodeList) //.stream() .parallelStream()// .filter(term -> { final Node node = _abox.getNode(term); return !node.isPruned() && node.isIndividual(); })// .map(_abox::getIndividual); }
public Stream<Individual> nodes() { return new ArrayList<>(_nodeList) //.stream() .parallelStream()// .filter(term -> { final Node node = _abox.getNode(term); return !node.isPruned() && node.isIndividual(); })// .map(_abox::getIndividual); }
@Override public boolean setDifferent(final Node y, final Node z, final DependencySet ds) { if (super.setDifferent(y, z, ds)) { if (_interpreter != null && !_merging && !_abox.isClosed() && y.isRootNominal() && y.isIndividual() && z.isRootNominal() && z.isIndividual()) _interpreter._alphaNet.activateDifferent((Individual) y, (Individual) z, ds); return true; } return false; }
@Override public boolean setDifferent(final Node y, final Node z, final DependencySet ds) { if (super.setDifferent(y, z, ds)) { if (_interpreter != null && !_merging && !_abox.isClosed() && y.isRootNominal() && y.isIndividual() && z.isRootNominal() && z.isIndividual()) _interpreter._alphaNet.activateDifferent((Individual) y, (Individual) z, ds); return true; } return false; }
@Override public void addType(final Node node, final ATermAppl c, final DependencySet ds) { super.addType(node, c, ds); if (!_merging && !_abox.isClosed() && node.isRootNominal() && _interpreter != null && node.isIndividual()) { final Individual ind = (Individual) node; _interpreter._alphaNet.activateType(ind, c, ds); } }
@Override public void addType(final Node node, final ATermAppl c, final DependencySet ds) { super.addType(node, c, ds); if (!_merging && !_abox.isClosed() && node.isRootNominal() && _interpreter != null && node.isIndividual()) { final Individual ind = (Individual) node; _interpreter._alphaNet.activateType(ind, c, ds); } }
private void getDescendants(final Individual ind, final List<Individual> descendants) { descendants.add(ind); for (final Edge edge : ind.getOutEdges()) if (edge.getTo().isIndividual() && !edge.getTo().equals(ind)) getDescendants((Individual) edge.getTo(), descendants); }
private void getDescendants(final Individual ind, final List<Individual> descendants) { descendants.add(ind); for (final Edge edge : ind.getOutEdges()) if (edge.getTo().isIndividual() && !edge.getTo().equals(ind)) getDescendants((Individual) edge.getTo(), descendants); }
/** * Find the next _individual in a given queue * * @param type */ @Override protected void findNext(final int type) { for (; _current < _cutOff; _current++) { Node node = _abox.getNode(_queue.get(_current)); //because we do not maitain the _queue during restore this _node could be non-existent if (node == null) continue; node = node.getSame(); if ((node.isLiteral() && isAllowLiterals() || node.isIndividual() && !isAllowLiterals()) && !node.isPruned()) break; } }
/** * Find the next _individual in a given queue * * @param type */ @Override protected void findNext(final int type) { for (; _current < _cutOff; _current++) { Node node = _abox.getNode(_queue.get(_current)); //because we do not maitain the _queue during restore this _node could be non-existent if (node == null) continue; node = node.getSame(); if ((node.isLiteral() && isAllowLiterals() || node.isIndividual() && !isAllowLiterals()) && !node.isPruned()) break; } }
/** * Apply all values restriction for the Top object role * * @param allTopC * @param c * @param ds */ public void applyAllValuesTop(final ATermAppl allTopC, final ATermAppl c, final DependencySet ds) { for (final Node node : _strategy.getABox().getNodes().values()) if (node.isIndividual() && !node.isPruned() && !node.hasType(c)) { node.addType(c, ds); node.addType(allTopC, ds); if (_strategy.getABox().isClosed()) break; } } }
/** * Apply all values restriction for the Top object role * * @param allTopC * @param c * @param ds */ public void applyAllValuesTop(final ATermAppl allTopC, final ATermAppl c, final DependencySet ds) { for (final Node node : _strategy.getABox().getNodes().values()) if (node.isIndividual() && !node.isPruned() && !node.hasType(c)) { node.addType(c, ds); node.addType(allTopC, ds); if (_strategy.getABox().isClosed()) break; } } }
applyAllValues(subj, s, obj, c, finalDS); else if (obj.isIndividual())
if (isIndividual() && ATermUtils.isNominal(c)) return Bool.TRUE; if (isIndividual())
if (isIndividual() && ATermUtils.isNominal(c)) return Bool.TRUE; if (isIndividual())
applyAllValues(subj, s, obj, c, finalDS); else if (obj.isIndividual())
applyAllValues(x, s, y, c, finalDS); else if (y.isIndividual())
applyAllValues(x, s, y, c, finalDS); else if (y.isIndividual())