Talks and Poster Presentations (with Proceedings-Entry):

T. Eiter, T. Lukasiewicz, R. Schindlauer, H. Tompits:
"Well-founded Semantics for Description Logic Programs in the Semantic Web";
Talk: Rules and Rule Markup Languages for the Semantic Web, Hiroshima, Japan; 2004-11-08; in: "Rules and Rule Markup Languages for the Semantic Web: Third International Workshop, RuleML 2004", G. Antoniou, H. Boley (ed.); Springer, LNCS 3323 (2004), ISBN: 3-540-23842-5; 81 - 97.

English abstract:
In previous work, towards the integration of rules and ontologies in the Semantic Web, we have proposed a combination of logic programming under the answer set semantics with the description logics SHIF(D) and SHOIN(D), 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 L and a finite set of description logic rules P, 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.
This work was partially supported by the Austrian Science Fund under grants Z29-N04 and P17212-N04, by the European Commission through the IST REWERSE Network of Excellence and the Marie Curie Individual Fellowship HPMF-CT-2001-001286 (disclaimer: The authors are solely responsible for information communicated and the European Commission is not responsible for any views or results expressed), and by the German Research Foundation through a Heisenberg Fellowship. We thank Ulrike Sattler for providing valuable information on complexity-related issues about OWL-DL related description logics.

Online library catalogue of the TU Vienna:

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.