Repairing ontologies for incomplete reasoners

author: Giorgos Stoilos, Computing Laboratory, Oxford University
published: Nov. 25, 2011,   recorded: October 2011,   views: 62
Categories

Slides

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

The need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the problem of "repairing" an ontology T |that is, computing an ontology R such that a reasoner that is incomplete for T becomes complete when used with T [R. We identify conditions on T and the reasoner that make this possible, present a practical algorithm for computing R, and present a preliminary evaluation which shows that, in some realistic cases, repairs are feasible to compute, reasonable in size, and do not signifi cantly aff ect reasoner performance.

See Also:

Download slides icon Download slides: iswc2011_stoilos_reasoners_01.pdf (278.8┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: