private void addUnfolding(final ATermAppl c, final ATermAppl condition, final ATermAppl result, final Set<ATermAppl> explanation) { List<Unfolding> list = _conditionalUnfoldings.get(c); if (list == null) { list = CollectionUtils.makeList(); _conditionalUnfoldings.put(c, list); } list.add(Unfolding.create(result, condition, explanation)); }
private void addUnfolding(final ATermAppl c, final ATermAppl condition, final ATermAppl result, final Set<ATermAppl> explanation) { List<Unfolding> list = _conditionalUnfoldings.get(c); if (list == null) { list = CollectionUtils.makeList(); _conditionalUnfoldings.put(c, list); } list.add(Unfolding.create(result, condition, explanation)); }
@Override protected List<ATermAppl> computeDefinitionOrder() { final List<ATermAppl> definitionOrder = CollectionUtils.makeList(); definitionOrder.add(TOP); definitionOrder.addAll(getEquivalents(TOP)); _graph.removeVertex(TOP); destructiveTopologocialSort(definitionOrder); definitionOrder.add(BOTTOM); return definitionOrder; }
@Override protected List<ATermAppl> computeDefinitionOrder() { final List<ATermAppl> definitionOrder = CollectionUtils.makeList(); definitionOrder.add(TOP); definitionOrder.addAll(getEquivalents(TOP)); _graph.removeVertex(TOP); destructiveTopologocialSort(definitionOrder); definitionOrder.add(BOTTOM); return definitionOrder; }
private static List<ATermAppl> normalizeDisjointAxiom(final ATermAppl... concepts) { final List<ATermAppl> axioms = CollectionUtils.makeList(); for (int i = 0; i < concepts.length - 1; i++) { final ATermAppl c1 = concepts[i]; final ATermAppl notC1 = ATermUtils.makeNot(c1); for (int j = i + 1; j < concepts.length; j++) { final ATermAppl c2 = concepts[j]; final ATermAppl notC2 = ATermUtils.makeNot(c2); axioms.add(ATermUtils.makeSub(c1, notC2)); if (ATermUtils.isPrimitive(c2)) axioms.add(ATermUtils.makeSub(c2, notC1)); } } return axioms; }
private static List<ATermAppl> normalizeDisjointAxiom(final ATermAppl... concepts) { final List<ATermAppl> axioms = CollectionUtils.makeList(); for (int i = 0; i < concepts.length - 1; i++) { final ATermAppl c1 = concepts[i]; final ATermAppl notC1 = ATermUtils.makeNot(c1); for (int j = i + 1; j < concepts.length; j++) { final ATermAppl c2 = concepts[j]; final ATermAppl notC2 = ATermUtils.makeNot(c2); axioms.add(ATermUtils.makeSub(c1, notC2)); if (ATermUtils.isPrimitive(c2)) axioms.add(ATermUtils.makeSub(c2, notC1)); } } return axioms; }
for (final Entry<ATermAppl, Set<ConceptInfo>> entry : CollectionUtils.makeList(pred.getPredecessors().entrySet())) for (final ConceptInfo predOfPred : CollectionUtils.makeList(entry.getValue())) addSuccessor(predOfPred, supProp, succ); for (final Entry<ATermAppl, Set<ConceptInfo>> entry : CollectionUtils.makeList(succ.getSuccessors().entrySet())) for (final ConceptInfo succOfSucc : CollectionUtils.makeList(entry.getValue())) addSuccessor(pred, supProp, succOfSucc);
for (final Entry<ATermAppl, Set<ConceptInfo>> entry : CollectionUtils.makeList(pred.getPredecessors().entrySet())) for (final ConceptInfo predOfPred : CollectionUtils.makeList(entry.getValue())) addSuccessor(predOfPred, supProp, succ); for (final Entry<ATermAppl, Set<ConceptInfo>> entry : CollectionUtils.makeList(succ.getSuccessors().entrySet())) for (final ConceptInfo succOfSucc : CollectionUtils.makeList(entry.getValue())) addSuccessor(pred, supProp, succOfSucc);