Name
Abstract | ||
|---|---|---|
Finding the justifications of an entailment, i.e. minimal sets of axioms responsible for the entailment, is an important problem in ontology engineering and thus has become a key reasoning task for Description Logic-based ontologies. Although practical techniques to find all possible justifications exist, efficiency is still a problem. Furthermore, in the worst case the number of justifications for a subsumption entailment is exponential in the size of the ontology. Therefore, it is not always desirable to compute all justifications. In this paper, we propose a novel black-box algorithm that iteratively constructs a set of justifications of an entailment using a relevance-based selection function. Each justification returned by our algorithm is attached with a weight denoting its relevance degree w.r.t. the entailment. Finally, we implement the algorithm and present evaluation results over real-life ontologies that show the benefits of the selection function. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-10871-6_21 | ASWC |
Keywords | Field | DocType |
ontology engineering,important problem,subsumption entailment,real-life ontology,novel black-box algorithm,dl entailments,description logic-based ontology,selection function,relevance-based selection function,relevance-directed algorithm,key reasoning task,iteratively construct,description logic | Ontology (information science),Ontology engineering,Data mining,Ontology,Logical consequence,Computer science,Axiom,Description logic,Algorithm,Preferential entailment | Conference |
Volume | Issue | ISSN |
5926 | null | 0302-9743 |
Citations | PageRank | References |
12 | 0.56 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiu Ji | 1 | 136 | 5.76 |
| Guilin Qi | 2 | 961 | 88.58 |
| Peter Haase | 3 | 1727 | 114.59 |