private Set<ATermAppl> createSet() { return _comparator != null ? new TreeSet<>(_comparator) : CollectionUtils.<ATermAppl> makeIdentitySet(); }
private Set<ATermAppl> createSet() { return _comparator != null ? new TreeSet<>(_comparator) : CollectionUtils.<ATermAppl> makeIdentitySet(); }
@Override protected Set<ATermAppl> computeCycles() { final Set<ATermAppl> cyclicConcepts = CollectionUtils.makeIdentitySet(); for (final TaxonomyNode<ATermAppl> node : _definitionOrderTaxonomy.getNodes().values()) { final Set<ATermAppl> names = node.getEquivalents(); if (names.size() > 1) cyclicConcepts.addAll(names); } return cyclicConcepts; }
@Override protected Set<ATermAppl> computeCycles() { final Set<ATermAppl> cyclicConcepts = CollectionUtils.makeIdentitySet(); for (final TaxonomyNode<ATermAppl> node : _definitionOrderTaxonomy.getNodes().values()) { final Set<ATermAppl> names = node.getEquivalents(); if (names.size() > 1) cyclicConcepts.addAll(names); } return cyclicConcepts; }
@Override protected Set<ATermAppl> computeCycles() { final Set<ATermAppl> cyclicConcepts = CollectionUtils.makeIdentitySet(); cyclicConcepts.addAll(getEquivalents(TOP)); final StrongConnectivityAlgorithm<ATermAppl, DefaultEdge> scInspector = new KosarajuStrongConnectivityInspector<>(_graph); final List<Set<ATermAppl>> sccList = scInspector.stronglyConnectedSets(); for (final Set<ATermAppl> scc : sccList) { if (scc.size() == 1) continue; cyclicConcepts.addAll(scc); collapseCycle(scc); } return cyclicConcepts; }
@Override protected Set<ATermAppl> computeCycles() { final Set<ATermAppl> cyclicConcepts = CollectionUtils.makeIdentitySet(); cyclicConcepts.addAll(getEquivalents(TOP)); final StrongConnectivityAlgorithm<ATermAppl, DefaultEdge> scInspector = new KosarajuStrongConnectivityInspector<>(_graph); final List<Set<ATermAppl>> sccList = scInspector.stronglyConnectedSets(); for (final Set<ATermAppl> scc : sccList) { if (scc.size() == 1) continue; cyclicConcepts.addAll(scc); collapseCycle(scc); } return cyclicConcepts; }
public AbstractDefinitionOrder(final KnowledgeBase kb, final Comparator<ATerm> comparator) { _kb = kb; _comparator = comparator; _cyclicConcepts = CollectionUtils.makeIdentitySet(); _definitionOrder = new ArrayList<>(kb.getClasses().size() + 2); initialize(); processDefinitions(); _cyclicConcepts = computeCycles(); _definitionOrder = computeDefinitionOrder(); }
public AbstractDefinitionOrder(final KnowledgeBase kb, final Comparator<ATerm> comparator) { _kb = kb; _comparator = comparator; _cyclicConcepts = CollectionUtils.makeIdentitySet(); _definitionOrder = new ArrayList<>(kb.getClasses().size() + 2); initialize(); processDefinitions(); _cyclicConcepts = computeCycles(); _definitionOrder = computeDefinitionOrder(); }
return false; final Set<ATermAppl> candidates1 = CollectionUtils.makeIdentitySet(); final Set<ATermAppl> candidates2 = CollectionUtils.makeIdentitySet(); for (final ATermAppl term : terms)
return false; final Set<ATermAppl> candidates1 = CollectionUtils.makeIdentitySet(); final Set<ATermAppl> candidates2 = CollectionUtils.makeIdentitySet(); for (final ATermAppl term : terms)
@Override public boolean absorb(final Set<ATermAppl> terms, final Set<ATermAppl> explanation) { for (final ATermAppl term : terms) { if (!isSomeValues(term)) continue; final ATermAppl p = (ATermAppl) term.getArgument(0); final ATermAppl c = (ATermAppl) term.getArgument(1); if (!_kb.isObjectProperty(p)) continue; terms.remove(term); if (terms.size() == 1 && isNegatedPrimitive(c) && isNegatedPrimitive(terms.iterator().next())) { terms.add(term); return false; } final ATermAppl a = freshConcept(); terms.add(a); absorbAxiom(terms, explanation); final Set<ATermAppl> newTerms = CollectionUtils.makeIdentitySet(); newTerms.add(nnf(c)); newTerms.add(some(inv(p), not(a))); absorbAxiom(newTerms, explanation); return true; } return false; } }
@Override public boolean absorb(final Set<ATermAppl> terms, final Set<ATermAppl> explanation) { for (final ATermAppl term : terms) { if (!isSomeValues(term)) continue; final ATermAppl p = (ATermAppl) term.getArgument(0); final ATermAppl c = (ATermAppl) term.getArgument(1); if (!_kb.isObjectProperty(p)) continue; terms.remove(term); if (terms.size() == 1 && isNegatedPrimitive(c) && isNegatedPrimitive(terms.iterator().next())) { terms.add(term); return false; } final ATermAppl a = freshConcept(); terms.add(a); absorbAxiom(terms, explanation); final Set<ATermAppl> newTerms = CollectionUtils.makeIdentitySet(); newTerms.add(nnf(c)); newTerms.add(some(inv(p), not(a))); absorbAxiom(newTerms, explanation); return true; } return false; } }
protected void updateDependencies() { _dependencies = CollectionUtils.makeIdentitySet(); for (final ATermAppl sub : getSubClassAxioms()) ATermUtils.findPrimitives((ATermAppl) sub.getArgument(1), _dependencies); for (final ATermAppl eq : getEqClassAxioms()) ATermUtils.findPrimitives((ATermAppl) eq.getArgument(1), _dependencies); } }
protected void updateDependencies() { _dependencies = CollectionUtils.makeIdentitySet(); for (final ATermAppl sub : getSubClassAxioms()) ATermUtils.findPrimitives((ATermAppl) sub.getArgument(1), _dependencies); for (final ATermAppl eq : getEqClassAxioms()) ATermUtils.findPrimitives((ATermAppl) eq.getArgument(1), _dependencies); } }