| Question asked
|
What is the time complexity of the propo …
What is the time complexity of the proposed algorithm with respect to the number of subsumptions that change their entailment status?
One of the main assumptions proposed in section 3 is that "the number of subsumptions that change their entailment status w.r.t. the ontology ... is probably small compared to the number of subsumptions that do not ...." What about when mapping ontologies? For example, consider the paper "Collecting Community-Based Mappings in an Ontology Repository". In that paper, users are allowed to map certain relationships between ontologies. These mappings do not use OWL properties but rather properties indicating, for example, that two classes _could_ be considered equivalent (among others). Now imagine a user selects an ontology to add to his/her own preexisting ontology, replacing those "could-be-considered-equivalent-class" relations (between the two ontologies) with actual owl:equivalentClass relations for purposes of reasoning over data that uses both ontologies. This seems like a plausible situation in which the aforementioned assumption may not hold. What kind of results would be gotten from experiments reflecting this ontology-mapping example?
A casual question of interest: How could such an incremental approach be applied (if at all) to promote reasoning in large and/or distributed RDF stores? ng in large and/or distributed RDF stores?
|
