AbstractInlinedStep(ProofStep<OWLAxiom> step) { this.conclusion_ = step.getConclusion(); this.premises_ = new ArrayList<ProofNode<OWLAxiom>>( step.getPremises().size()); process(step); }
static boolean canConvertStep(ProofStep<OWLAxiom> step) { return step.getName() == NAME; }
if (step.getName() != ElkClassInclusionExistentialComposition.NAME) { return null; List<? extends ProofNode<OWLAxiom>> premises = step.getPremises(); ProofNode<OWLAxiom> lastPremise = premises.get(premises.size() - 1); Collection<? extends ProofStep<OWLAxiom>> lastPremiseSteps = lastPremise .getName() == ElkPropertyInclusionOfTransitiveObjectProperty.NAME) { return lastPremiseStep.getPremises().get(0);
static ProofStep<OWLAxiom> convert(ProofStep<OWLAxiom> step) { if (!canConvertStep(step)) { return null; } // else ProofStep<OWLAxiom> result = new InlinedPropertyInclusionHierarchyStep( step); if (result.getPremises().size() == step.getPremises().size()) { result = step; } return result; }
static ProofStep<OWLAxiom> convert(ProofStep<OWLAxiom> step) { if (!canConvertStep(step)) { return null; } // else ProofStep<OWLAxiom> result = new InlinedClassInclusionHierarchyStep( step); if (result.getPremises().size() == step.getPremises().size()) { result = step; } return result; }
@Override void process(ProofStep<OWLAxiom> step) { List<? extends ProofNode<OWLAxiom>> premises = step.getPremises(); for (int i = 0; i < premises.size(); i++) { ProofNode<OWLAxiom> premise = premises.get(i); if (!process(premise)) { // inferences for the premise cannot be flattened addPremise(premise); } } }
static boolean canConvertStep(ProofStep<OWLAxiom> step) { return step.getName() == NAME; }
@Override void process(ProofStep<OWLAxiom> step) { List<? extends ProofNode<OWLAxiom>> premises = step.getPremises(); for (int i = 0; i < premises.size() - 1; i++) { ProofNode<OWLAxiom> premise = premises.get(i); if (!process(premise)) { // inferences for the premise cannot be flattened addPremise(premise); } } }