@Override public void addType(final ATermAppl c, final DependencySet ds) { addType(c, ds, true); }
@Override public void addType(final ATermAppl c, final DependencySet ds) { addType(c, ds, true); }
private Individual addIndividual(final ATermAppl x, final Individual parent, final DependencySet ds) { if (_nodes.containsKey(x)) throw new InternalReasonerException("adding a _node twice " + x); setChanged(true); final Individual n = new Individual(x, this, parent); _nodes.put(x, n); _nodeList.add(x); if (n.getDepth() > _stats._treeDepth) { _stats._treeDepth = n.getDepth(); if (_logger.isLoggable(Level.FINER)) _logger.finer("Depth: " + _stats._treeDepth + " Size: " + size()); } //this must be performed after the _nodeList is updated as this call will update the completion queues n.addType(ATermUtils.TOP, ds); if (getBranchIndex() > 0 && OpenlletOptions.TRACK_BRANCH_EFFECTS) _branchEffects.add(getBranchIndex(), n.getName()); return n; }
private Individual addIndividual(final ATermAppl x, final Individual parent, final DependencySet ds) { if (_nodes.containsKey(x)) throw new InternalReasonerException("adding a _node twice " + x); setChanged(true); final Individual n = new Individual(x, this, parent); _nodes.put(x, n); _nodeList.add(x); if (n.getDepth() > _stats._treeDepth) { _stats._treeDepth = n.getDepth(); if (_logger.isLoggable(Level.FINER)) _logger.finer("Depth: " + _stats._treeDepth + " Size: " + size()); } //this must be performed after the _nodeList is updated as this call will update the completion queues n.addType(ATermUtils.TOP, ds); if (getBranchIndex() > 0 && OpenlletOptions.TRACK_BRANCH_EFFECTS) _branchEffects.add(getBranchIndex(), n.getName()); return n; }
@Override public void addType(final ATermAppl x, final ATermAppl cParam, final DependencySet dsParam) { ATermAppl c = cParam; DependencySet ds = dsParam; c = ATermUtils.normalize(c); // when a type is being added to // an ABox that has already been completed, the _branch // of the dependency set will automatically be set to // the _current _branch. We need to set it to the initial // _branch number to make sure that this type assertion // will not be removed during backtracking final int remember = _branchIndex; setBranchIndex(DependencySet.NO_BRANCH); Individual node = getIndividual(x); node.addType(c, ds, false); while (node.isMerged()) { ds = ds.union(node.getMergeDependency(false), _doExplanation); node = (Individual) node.getMergedTo(); node.addType(c, ds, !node.isMerged()); } setBranchIndex(remember); }
@Override public void addType(final ATermAppl x, final ATermAppl cParam, final DependencySet dsParam) { ATermAppl c = cParam; DependencySet ds = dsParam; c = ATermUtils.normalize(c); // when a type is being added to // an ABox that has already been completed, the _branch // of the dependency set will automatically be set to // the _current _branch. We need to set it to the initial // _branch number to make sure that this type assertion // will not be removed during backtracking final int remember = _branchIndex; setBranchIndex(DependencySet.NO_BRANCH); Individual node = getIndividual(x); node.addType(c, ds, false); while (node.isMerged()) { ds = ds.union(node.getMergeDependency(false), _doExplanation); node = (Individual) node.getMergedTo(); node.addType(c, ds, !node.isMerged()); } setBranchIndex(remember); }
n.setNominalLevel(Node.BLOCKABLE); n.setConceptRoot(true); n.addType(ATermUtils.TOP, DependencySet.INDEPENDENT); _nodes.put(extraIndividual, n); _nodeList.add(extraIndividual);
n.setNominalLevel(Node.BLOCKABLE); n.setConceptRoot(true); n.addType(ATermUtils.TOP, DependencySet.INDEPENDENT); _nodes.put(extraIndividual, n); _nodeList.add(extraIndividual);
addType(conj, ds, checkForPruned);
addType(conj, ds, checkForPruned);