KSL-03-06 + redirect page
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web + Has identifier
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web + Ksl tr id
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web + Number
| Towards Practical Taxonomic Classification for Description Logics on the Semantic Web |
Bibtype
techreport
Has publishing details
2003
Has title
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web
Has where published
KSL-03-06
Has year
2003
Title
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web
Year
2003
Abstract
Description logics offer a well-defined se … Description logics offer a well-defined semantics for many common and useful reasoning tasks that can be formalized under the notion of subsumption and are currently finding use as a representation language for the Semantic Web (e.g., DAML+OIL). For this domain, description logics can be highly useful for reasoning about relationships between entities in distributed knowledge bases by classifying them into a taxonomic subsumption hierarchy. However, there are many practical considerations for designing a sound and complete, yet efficient algorithm for performing large-scale taxonomic classification. Traditionally, structural subsumption algorithms have provided efficient techniques for performing classification but have only supported relatively inexpressive languages. Consequently, in response to the need for efficient taxonomic classification of more expressive languages, we develop an approach that extends previous structural subsumption algorithms to support sound and complete classification of a moderately expressive description logic including both conjunctive and disjunctive constructors. Furthermore, we extend this algorithm to a more expressive description logic with the claim that its sources of incompleteness are infrequent and benign in practice. Finally, we show that for the expected distribution of concept structures, both of these taxonomic classification algorithms require polynomial time in the size of the knowledge base and argue that such a result is a necessity for practical classification algorithms that will scale with the expected growth of the Semantic Web. h the expected growth of the Semantic Web.
Author
Scott P. Sanner +
Has author
Scott P. Sanner +
Has identifier
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web +
Institution
Knowledge Systems, AI Laboratory +
Ksl tr id
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web +
Number
Towards Practical Taxonomic Classification for Description Logics on the Semantic Web +
Process note
NO +
Categories KSL Technical Report +, Publication +, Technical Report +
|
