public boolean hasObviousType(final Collection<ATermAppl> coll) { for (final ATermAppl c : coll) { final DependencySet ds = getDepends(c); if (ds != null && ds.isIndependent()) return true; } return false; }
public boolean hasObviousType(final Collection<ATermAppl> coll) { for (final ATermAppl c : coll) { final DependencySet ds = getDepends(c); if (ds != null && ds.isIndependent()) return true; } return false; }
@Override public Iterator<WME> getMatches(final int argIndex, final Node arg) { if (_name != null || argIndex != 0) throw new IndexOutOfBoundsException(); if (!(arg instanceof Individual)) throw new IllegalArgumentException(); final DependencySet depends = arg.getDepends(_predicate); return (depends == null) ? IteratorUtils.<WME> emptyIterator() : IteratorUtils.<WME> singletonIterator(WME.createType((Individual) arg, _predicate, depends)); }
@Override public Iterator<WME> getMatches(final int argIndex, final Node arg) { if (_name != null || argIndex != 0) throw new IndexOutOfBoundsException(); if (!(arg instanceof Individual)) throw new IllegalArgumentException(); final DependencySet depends = arg.getDepends(_predicate); return (depends == null) ? IteratorUtils.<WME> emptyIterator() : IteratorUtils.<WME> singletonIterator(WME.createType((Individual) arg, _predicate, depends)); }
ds = ds.union(edge.getDepends(), _abox.doExplanation()); final Node node = edge.getNeighbor(this); final DependencySet typeDS = node.getDepends(c); if (typeDS != null) ds = ds.union(typeDS, _abox.doExplanation());
ds = ds.union(edge.getDepends(), _abox.doExplanation()); final Node node = edge.getNeighbor(this); final DependencySet typeDS = node.getDepends(c); if (typeDS != null) ds = ds.union(typeDS, _abox.doExplanation());
final DependencySet d = getDepends(c); for (final ATermAppl c : conjunctions) final DependencySet d = getDepends(c); for (ATermList cs = (ATermList) c.getArgument(0); !cs.isEmpty(); cs = cs.getNext())
final DependencySet d = getDepends(c); for (final ATermAppl c : conjunctions) final DependencySet d = getDepends(c); for (ATermList cs = (ATermList) c.getArgument(0); !cs.isEmpty(); cs = cs.getNext())
for (final DependencySet typeDep : n.getDepends().values()) ds = ds.union(typeDep, _strategy.getABox().doExplanation()); for (final DependencySet typeDep : n.getDepends().values()) ds = ds.union(typeDep, _strategy.getABox().doExplanation()); _strategy.getABox().setClash(Clash.invalidLiteral(ind, ds));
for (final DependencySet typeDep : n.getDepends().values()) ds = ds.union(typeDep, _strategy.getABox().doExplanation()); for (final DependencySet typeDep : n.getDepends().values()) ds = ds.union(typeDep, _strategy.getABox().doExplanation()); _strategy.getABox().setClash(Clash.invalidLiteral(ind, ds));
for (final Entry<ATermAppl, DependencySet> entry : node.getDepends().entrySet()) // update type dependencies
for (final Entry<ATermAppl, DependencySet> entry : node.getDepends().entrySet()) // update type dependencies
final Role role = _abox.getRole(pred); if (_logger.isLoggable(Level.FINE) && !((Individual) node).hasRSuccessor(role, node)) _logger.fine("SELF: " + node + " " + role + " " + node.getDepends(c)); addEdge((Individual) node, role, node, ds);
final Role role = _abox.getRole(pred); if (_logger.isLoggable(Level.FINE) && !((Individual) node).hasRSuccessor(role, node)) _logger.fine("SELF: " + node + " " + role + " " + node.getDepends(c)); addEdge((Individual) node, role, node, ds);
final DependencySet ds = node.getDepends(ATermUtils.normalize(desc));
final DependencySet ds = node.getDepends(ATermUtils.normalize(desc));
public Bool hasObviousType(final ATermAppl c) DependencySet ds = getDepends(c); if ((ds = getDepends(ATermUtils.negate(c))) != null)
public Bool hasObviousType(final ATermAppl c) DependencySet ds = getDepends(c); if ((ds = getDepends(ATermUtils.negate(c))) != null)
ds = ds.union(head.getDepends(c), _strategy.getABox().doExplanation()); ds = ds.union(r.getExplainSubOrInv(edge.getRole()), _strategy.getABox().doExplanation()); break; ds = ds.union(next.getDepends(c), _strategy.getABox().doExplanation()); ds = ds.union(r.getExplainSubOrInv(edge.getRole()), _strategy.getABox().doExplanation()); ds = ds.union(head.getDepends(c), _strategy.getABox().doExplanation()); ds = ds.union(next.getDepends(c), _strategy.getABox().doExplanation()); ds = ds.union(next.getDifferenceDependency(head), _strategy.getABox().doExplanation()); if (r.isFunctional())
final DependencySet typeDS = neighbor.getDepends(c); if (typeDS != null)