A Tableau Algorithm for Handling Inconsistency in OWL
published: July 28, 2009, recorded: June 2009, views: 4235
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
In Semantic Web, the knowledge sources usually contain inconsistency because they are constantly changing and from different view points. As is well known, as based on the description logic of the Semantic Web, OWL is lack of the ability of tolerating inconsistent or incomplete data. Recently, the research in handling inconsistency in OWL becomes more and more important. In this paper, we present a paraconsistent OWL called quasi-classical OWL to handle inconsistency with holding important inference rules such as modus tollens, modus ponens, and disjunctive syllogism. We propose a terminable, sound and complete tableau algorithm to implement paraconsistent reasoning in quasi-classical OWL. In comparison with other approaches to handle inconsistency in OWL, our approach enhances the ability of reasoning by integrating paraconsistent reasoning with important classical inference rules.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !