Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/www2008/paper/226> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- 226 creator jianfeng-du.
- 226 creator yi-dong-shen.
- 226 type InProceedings.
- 226 label "Computing Minimum Cost Diagnoses to Repair Populated DL-based Ontologies".
- 226 sameAs 226.
- 226 abstract "Ontology population is prone to cause inconsistency because the populating process is imprecise and the populated data may conflict with the original data. By assuming that the intensional part of the ontology is fixed and each removable ABox assertion is given a removal cost, we intend to repair an inconsistent DL-based ontology by deleting a subset of removable ABox assertions in which the sum of removal costs is minimum. We call such subset a minimum cost diagnosis. We show that computing a minimum cost diagnosis for a DL-Lite ontology cannot be accomplished in polynomial time w.r.t.\ data complexity unless P=NP. Nevertheless, we present a feasible computational method for more general (i.e., SHIQ) ontologies. It transforms a SHIQ ontology to a set of propositional programs in polynomial time w.r.t.\ data complexity, thus reducing the original problem into a set of subproblems that are independent of each other, where each subproblem computes a certain model and is solvable in logarithmic calls to a standard SAT solver. Experimental results show that the proposed method can practically handle moderately complex ontologies with thousands of removable ABox assertions.".
- 226 hasAuthorList authorList.
- 226 hasTopic World_Wide_Web.
- 226 isPartOf proceedings.
- 226 keyword "Description Logics".
- 226 keyword "Diagnosis".
- 226 keyword "Disjunctive Datalog".
- 226 keyword "Ontology Population".
- 226 keyword "Partitioning".
- 226 title "Computing Minimum Cost Diagnoses to Repair Populated DL-based Ontologies".