Well−Founded Semantics for Description Logic Programs in the Semantic Web
<p>In previous work, towards the integration of rules and ontologies in the SemanticWeb, we have proposed a combination of logic programming under the answer set semantics with the description logics <em>SHIF(D)</em> and <em>SHOIN(D)</em>, which underly the Web ontology...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2004
|
| _version_ | 1797050378897850368 |
|---|---|
| author | Eiter, T Lukasiewicz, T Schindlauer, R Tompits, H |
| author_facet | Eiter, T Lukasiewicz, T Schindlauer, R Tompits, H |
| author_sort | Eiter, T |
| collection | OXFORD |
| description | <p>In previous work, towards the integration of rules and ontologies in the SemanticWeb, we have proposed a combination of logic programming under the answer set semantics with the description logics <em>SHIF(D)</em> and <em>SHOIN(D)</em>, which underly the Web ontology languages OWL Lite and OWL DL, respectively. More precisely, we have introduced description logic programs (or dl-programs), which consist of a description logic knowledge base <em>L</em> and a finite set of description logic rules <em>P</em>, and we have defined their answer set semantics. In this paper, we continue this line of research. Here, as a central contribution, we present the well-founded semantics for dl-programs, and we analyze its semantic properties. In particular, we show that it generalizes the well-founded semantics for ordinary normal programs. Furthermore, we show that in the general case, the well-founded semantics of dl-programs is a partial model that approximates the answer set semantics, whereas in the positive and the stratified case, it is a total model that coincides with the answer set semantics. Finally, we also provide complexity results for dl-programs under the well-founded semantics.</p> |
| first_indexed | 2024-03-06T18:04:15Z |
| format | Conference item |
| id | oxford-uuid:00e60ec3-fbe2-48c2-a22d-163bb5885606 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:04:15Z |
| publishDate | 2004 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:00e60ec3-fbe2-48c2-a22d-163bb58856062022-03-26T08:32:01ZWell−Founded Semantics for Description Logic Programs in the Semantic WebConference itemhttp://purl.org/coar/resource_type/c_5794uuid:00e60ec3-fbe2-48c2-a22d-163bb5885606Department of Computer ScienceSpringer2004Eiter, TLukasiewicz, TSchindlauer, RTompits, H<p>In previous work, towards the integration of rules and ontologies in the SemanticWeb, we have proposed a combination of logic programming under the answer set semantics with the description logics <em>SHIF(D)</em> and <em>SHOIN(D)</em>, which underly the Web ontology languages OWL Lite and OWL DL, respectively. More precisely, we have introduced description logic programs (or dl-programs), which consist of a description logic knowledge base <em>L</em> and a finite set of description logic rules <em>P</em>, and we have defined their answer set semantics. In this paper, we continue this line of research. Here, as a central contribution, we present the well-founded semantics for dl-programs, and we analyze its semantic properties. In particular, we show that it generalizes the well-founded semantics for ordinary normal programs. Furthermore, we show that in the general case, the well-founded semantics of dl-programs is a partial model that approximates the answer set semantics, whereas in the positive and the stratified case, it is a total model that coincides with the answer set semantics. Finally, we also provide complexity results for dl-programs under the well-founded semantics.</p> |
| spellingShingle | Eiter, T Lukasiewicz, T Schindlauer, R Tompits, H Well−Founded Semantics for Description Logic Programs in the Semantic Web |
| title | Well−Founded Semantics for Description Logic Programs in the Semantic Web |
| title_full | Well−Founded Semantics for Description Logic Programs in the Semantic Web |
| title_fullStr | Well−Founded Semantics for Description Logic Programs in the Semantic Web |
| title_full_unstemmed | Well−Founded Semantics for Description Logic Programs in the Semantic Web |
| title_short | Well−Founded Semantics for Description Logic Programs in the Semantic Web |
| title_sort | well founded semantics for description logic programs in the semantic web |
| work_keys_str_mv | AT eitert wellfoundedsemanticsfordescriptionlogicprogramsinthesemanticweb AT lukasiewiczt wellfoundedsemanticsfordescriptionlogicprogramsinthesemanticweb AT schindlauerr wellfoundedsemanticsfordescriptionlogicprogramsinthesemanticweb AT tompitsh wellfoundedsemanticsfordescriptionlogicprogramsinthesemanticweb |