@prefix this: <http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg> .
@prefix sub: <http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix prov: <http://www.w3.org/ns/prov#> .
@prefix pav: <http://purl.org/pav/> .
@prefix np: <http://www.nanopub.org/nschema#> .
@prefix doco: <http://purl.org/spar/doco/> .
@prefix c4o: <http://purl.org/spar/c4o/> .

sub:Head {
  this: np:hasAssertion sub:assertion;
    np:hasProvenance sub:provenance;
    np:hasPublicationInfo sub:pubinfo;
    a np:Nanopublication .
}

sub:assertion {
  sub:paragraph c4o:hasContent "Proof. The algorithm of the Find stage iterates over all the triples associated with each distinct triple subject in T , therefore the complexity of this stage is O(|T |). In the Verify stage, the algorithm firstly iterates over the answers obtained from the previous stage, which corresponds to T . Next, the algorithm iterates over the quality issues detected in the Find stage; in the worst case, each quality issue is found in at least one triple, then, the set Q 0 is equal to Q. For each quality is- sue, the algorithm processes the triples annotated with that quality issue, which again in the worst case is T (all the triples present all the quality issues). There- fore, the complexity of the Find stage is calculated as O(|T | + |T ||Q|), then O(|T ||Q|). ";
    a doco:Paragraph .
}

sub:provenance {
  sub:assertion prov:hadPrimarySource <http://dx.doi.org/10.3233/SW-160239>;
    prov:wasAttributedTo <https://orcid.org/0000-0003-0530-4305> .
}

sub:pubinfo {
  this: dc:created "2019-11-08T18:05:11+01:00"^^xsd:dateTime;
    pav:createdBy <https://orcid.org/0000-0002-7114-6459> .
}