• Well-founded semantics for des...

Treffer: Well-founded semantics for description logic programs in the semantic Web

Title:
Well-founded semantics for description logic programs in the semantic Web
Authors:
EITER, Thomas, LUKASIEWICZ, Thomas, SCHINDLAUER, Roman, TOMPITS, Hans
Source:
Rules and rule markup languages for the semantic web (Hiroshima, 8 November 2004)Lecture notes in computer science. :81-97
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 35 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Base connaissance, Knowledge base, Base conocimiento, Complexité programme, Program complexity, Complejidad programa, Internet, Modélisation, Modeling, Modelización, Ontologie, Ontology, Ontología, Programmation logique, Logical programming, Programación lógica, Représentation connaissances, Knowledge representation, Representación conocimientos, Réseau web, World wide web, Red WWW, Système réparti, Distributed system, Sistema repartido, Sémantique, Semantics, Semántica, Web sémantique, Semantic web, Web semántica, Langage marquage, Markup language, Lenguaje marcación, Logique description, Description logic, Lógica descripción
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institut für Informationssysteme, Technische Universität Wien, Favoritenstrasse 9-11, 1040 Vienna, Austria
Dipartimento di Informatica e Sistemistica, University di Roma La Sapienza, Via Salaria 113, 00198 Rome, Italy
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16334811
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16334811
Database:
PASCAL Archive

Weitere Informationen

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.