public void addAllTypes(final Map<ATermAppl, DependencySet> types, final DependencySet ds) { for (final Entry<ATermAppl, DependencySet> entry : types.entrySet()) { final ATermAppl c = entry.getKey(); if (hasType(c)) continue; final DependencySet depends = entry.getValue(); super.addType(c, depends.union(ds, _abox.doExplanation())); } checkClash(); }
public void addAllTypes(final Map<ATermAppl, DependencySet> types, final DependencySet ds) { for (final Entry<ATermAppl, DependencySet> entry : types.entrySet()) { final ATermAppl c = entry.getKey(); if (hasType(c)) continue; final DependencySet depends = entry.getValue(); super.addType(c, depends.union(ds, _abox.doExplanation())); } checkClash(); }
if (!literal.hasType(datatype)) try
if (!literal.hasType(datatype)) try
@Override public void addType(final ATermAppl c, final DependencySet d) { if (hasType(c)) return; /* * A negated nominal is turned into a different */ if (ATermUtils.isNot(c)) { final ATermAppl arg = (ATermAppl) c.getArgument(0); if (ATermUtils.isNominal(arg)) { final ATermAppl v = (ATermAppl) arg.getArgument(0); Literal other = _abox.getLiteral(v); if (other == null) other = _abox.addLiteral(v, d); super.setDifferent(other, d); return; } } super.addType(c, d); // TODO when two literals are being merged this is not efficient // if(_abox.isInitialized()) checkClash(); }
if (hasType(ATermUtils.BOTTOM_LIT))
if (hasType(ATermUtils.BOTTOM_LIT))
@Override public void addType(final ATermAppl c, final DependencySet d) { if (hasType(c)) return; /* * A negated nominal is turned into a different */ if (ATermUtils.isNot(c)) { final ATermAppl arg = (ATermAppl) c.getArgument(0); if (ATermUtils.isNominal(arg)) { final ATermAppl v = (ATermAppl) arg.getArgument(0); Literal other = _abox.getLiteral(v); if (other == null) other = _abox.addLiteral(v, d); super.setDifferent(other, d); return; } } super.addType(c, d); // TODO when two literals are being merged this is not efficient // if(_abox.isInitialized()) checkClash(); }