continue; final Node s = sOpt.get(); addTriple(triples, s, RDF.type.asNode(), OWL.Class.asNode()); makeGraphNode(eq).ifPresent(o -> addTriple(triples, s, p, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, p, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o)); for (final ATermAppl a : comp) if (classes.contains(a)) makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o));
addTriple(triples, s, pX, OWL.DatatypeProperty.asNode()); else if (role.isObjectRole()) addTriple(triples, s, pX, OWL.ObjectProperty.asNode()); else continue; addTriple(triples, s, pX, OWL.FunctionalProperty.asNode()); if (role.isInverseFunctional()) addTriple(triples, s, pX, OWL.InverseFunctionalProperty.asNode()); if (role.isTransitive()) addTriple(triples, s, pX, OWL.TransitiveProperty.asNode()); if (role.isSymmetric()) addTriple(triples, s, pX, OWL.SymmetricProperty.asNode()); addTriple(triples, s, pX, node); if (allSubs) addTriple(triples, s, RDFS.subPropertyOf.asNode(), node); }); for (final ATermAppl inverse : inverses) if (JenaUtils._isGrapheNode.test(inverse)) makeGraphNode(inverse).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); for (final ATermAppl eq : eqs) if (JenaUtils._isGrapheNode.test(eq)) makeGraphNode(eq).ifPresent(o -> addTriple(triples, s, pN, o));
addTriple(triples, s, pX, OWL.DatatypeProperty.asNode()); else if (role.isObjectRole()) addTriple(triples, s, pX, OWL.ObjectProperty.asNode()); else continue; addTriple(triples, s, pX, OWL.FunctionalProperty.asNode()); if (role.isInverseFunctional()) addTriple(triples, s, pX, OWL.InverseFunctionalProperty.asNode()); if (role.isTransitive()) addTriple(triples, s, pX, OWL.TransitiveProperty.asNode()); if (role.isSymmetric()) addTriple(triples, s, pX, OWL.SymmetricProperty.asNode()); addTriple(triples, s, pX, node); if (allSubs) addTriple(triples, s, RDFS.subPropertyOf.asNode(), node); }); for (final ATermAppl inverse : inverses) if (JenaUtils._isGrapheNode.test(inverse)) makeGraphNode(inverse).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); for (final ATermAppl eq : eqs) if (JenaUtils._isGrapheNode.test(eq)) makeGraphNode(eq).ifPresent(o -> addTriple(triples, s, pN, o));
continue; final Node s = sOpt.get(); addTriple(triples, s, RDF.type.asNode(), OWL.Class.asNode()); makeGraphNode(eq).ifPresent(o -> addTriple(triples, s, p, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, p, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o)); for (final ATermAppl a : comp) if (classes.contains(a)) makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o));
continue; final Node s = sOpt.get(); addTriple(triples, s, RDF.type.asNode(), OWL.Class.asNode()); makeGraphNode(eq).ifPresent(o -> addTriple(triples, s, p, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, p, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o)); for (final ATermAppl a : comp) if (classes.contains(a)) makeGraphNode(a).ifPresent(o -> addTriple(triples, s, pX, o));
addTriple(triples, s, pX, OWL.DatatypeProperty.asNode()); else if (role.isObjectRole()) addTriple(triples, s, pX, OWL.ObjectProperty.asNode()); else continue; addTriple(triples, s, pX, OWL.FunctionalProperty.asNode()); if (role.isInverseFunctional()) addTriple(triples, s, pX, OWL.InverseFunctionalProperty.asNode()); if (role.isTransitive()) addTriple(triples, s, pX, OWL.TransitiveProperty.asNode()); if (role.isSymmetric()) addTriple(triples, s, pX, OWL.SymmetricProperty.asNode()); addTriple(triples, s, pX, node); if (allSubs) addTriple(triples, s, RDFS.subPropertyOf.asNode(), node); }); for (final ATermAppl inverse : inverses) if (JenaUtils._isGrapheNode.test(inverse)) makeGraphNode(inverse).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); for (final ATermAppl eq : eqs) if (JenaUtils._isGrapheNode.test(eq)) makeGraphNode(eq).ifPresent(o -> addTriple(triples, s, pN, o));
makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); addTriple(triples, s, pX, s); for (final ATermAppl a : _kb.getSames(ind)) makeGraphNode(a).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(a).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(value).ifPresent(node -> addTriple(triples, s, p, node)); });
makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); addTriple(triples, s, pX, s); for (final ATermAppl a : _kb.getSames(ind)) makeGraphNode(a).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(a).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(value).ifPresent(node -> addTriple(triples, s, p, node)); });
makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); makeGraphNode(i.next()).ifPresent(o -> addTriple(triples, s, pX, o)); addTriple(triples, s, pX, s); for (final ATermAppl a : _kb.getSames(ind)) makeGraphNode(a).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(a).ifPresent(node -> addTriple(triples, s, pX, node)); makeGraphNode(value).ifPresent(node -> addTriple(triples, s, p, node)); });