Sciweavers

ESWS
2007
Springer

Algorithms for Paraconsistent Reasoning with OWL

14 years 5 months ago
Algorithms for Paraconsistent Reasoning with OWL
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, 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 OW...
Yue Ma, Pascal Hitzler, Zuoquan Lin
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where ESWS
Authors Yue Ma, Pascal Hitzler, Zuoquan Lin
Comments (0)