Techreport1390
Published: 2006
Dezember
Institution: AIFB, University of Karlsruhe
Archivierungsnummer: 1390
Kurzfassung
In an open, constantly changing and collaborative environment like
the forthcoming SemanticWeb, it is reasonable to expect that knowledge sources
will contain noise and inaccuracies. Practical reasoning techniques for ontologies
therefore will have to be tolerant to this kind of data, including the ability to
handle inconsistencies in a meaningful way. For this purpose, we employ paraconsistent
reasoning based on four-valued logic, which is a classical method for
dealing with inconsistencies in knowledge bases. Its transfer to OWL DL, however,
necessitates the making of fundamental design choices in dealing with class
inclusion, which has resulted in differing proposals for paraconsistent description
logics in the literature. In this paper, we build on one of the more general
approaches which due to its flexibility appears to be most promising for further
investigations.We present two algorithms suitable for implementation, one based
on a preprocessing before invoking a classical OWL reasoner, the other based on
a modification of the KAON2 transformation algorithms. We also report on our
implementation, called ParOWL.
Download: Media:2006_1390_Ma_Paraconsistent__1.pdf,Media:2006_1390_Ma_Paraconsistent__2.pdf
Wissensrepräsentation, Wissensrepräsentationssprachen, Logik, Nichtmonotones Schließen, Künstliche Intelligenz, Semantic Web