Ideal Downward Refinement in the EL Description Logic
With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineer...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2009
|
| _version_ | 1826264258390786048 |
|---|---|
| author | Lehmann, J Haase, C |
| author_facet | Lehmann, J Haase, C |
| author_sort | Lehmann, J |
| collection | OXFORD |
| description | With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algorithms based on refinement operators have been investigated. In this paper, we provide an ideal refinement operator for the description logic EL and show that it is computationally feasible on large knowledge bases. |
| first_indexed | 2024-03-06T20:04:52Z |
| format | Conference item |
| id | oxford-uuid:2893c571-e925-4d54-aae8-e2c620f47546 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T20:04:52Z |
| publishDate | 2009 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:2893c571-e925-4d54-aae8-e2c620f475462022-03-26T12:13:42ZIdeal Downward Refinement in the EL Description LogicConference itemhttp://purl.org/coar/resource_type/c_5794uuid:2893c571-e925-4d54-aae8-e2c620f47546Department of Computer ScienceSpringer2009Lehmann, JHaase, CWith the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algorithms based on refinement operators have been investigated. In this paper, we provide an ideal refinement operator for the description logic EL and show that it is computationally feasible on large knowledge bases. |
| spellingShingle | Lehmann, J Haase, C Ideal Downward Refinement in the EL Description Logic |
| title | Ideal Downward Refinement in the EL Description Logic |
| title_full | Ideal Downward Refinement in the EL Description Logic |
| title_fullStr | Ideal Downward Refinement in the EL Description Logic |
| title_full_unstemmed | Ideal Downward Refinement in the EL Description Logic |
| title_short | Ideal Downward Refinement in the EL Description Logic |
| title_sort | ideal downward refinement in the el description logic |
| work_keys_str_mv | AT lehmannj idealdownwardrefinementintheeldescriptionlogic AT haasec idealdownwardrefinementintheeldescriptionlogic |