BuiltinTerm(Resource resource, boolean isSyntax, boolean isABox) { this.node = resource.asNode(); this.isSyntax = isSyntax; this.isPredicate = resource instanceof Property; this.isABox = isABox; }
@Override public boolean doCheck( Node n, EnhGraph g ) { for (Iterator<Resource> i = ((OntModel) g).getProfile().getAnnotationProperties(); i.hasNext(); ) { if (i.next().asNode().equals( n )) { // a built-in annotation property return true; } } return g.asGraph().contains( n, RDF.type.asNode(), OWL.AnnotationProperty.asNode() ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.DatatypeProperty.asNode() ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.InverseFunctionalProperty.asNode() ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.FunctionalProperty.asNode() ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.DatatypeProperty.asNode() ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Ontology.asNode() ); } }
@Override public Model remove( Resource s, Property p, RDFNode o ) { graph.delete( Triple.create( s.asNode(), p.asNode(), o.asNode() ) ); return this; }
@Override public boolean doCheck( Node n, EnhGraph g ) { return n.isBlank() && g.asGraph().contains( n, RDF.type.asNode(), OWL.DataRange.asNode() ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.cardinality ) && containsSome( g, n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g,n, OWL.hasValue ) && containsSome( g,n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.allValuesFrom ) && containsSome( g, n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.cardinality ) && containsSome( g, n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.maxCardinality ) && containsSome( g, n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.cardinality ) && containsSome( g, n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g,n, OWL.someValuesFrom ) && containsSome( g,n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.minCardinality ) && containsSome( g, n, OWL.onProperty ); } }
@Override public boolean doCheck( Node n, EnhGraph g ) { return g.asGraph().contains( n, RDF.type.asNode(), OWL.Restriction.asNode() ) && containsSome( g, n, OWL.maxCardinality ) && containsSome( g, n, OWL.onProperty ); } }