How Incomplete Is Your Semantic Web Reasoner?

author: Giorgos Stoilos, Computing Laboratory, Oxford University
published: Sept. 1, 2010,   recorded: July 2010,   views: 4028

Related Open Educational Resources

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.


Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many SemanticWeb query answering systems give up completeness (i.e., they do not guarantee to return all query answers). It may be useful or even critical to the designers and users of such systems to understand how much and what kind of information is (potentially) being lost. We present a method for generating test data that can be used to provide at least partial answers to these questions, a purpose for which existing benchmarks are not well suited. In addition to developing a general framework that formalises the problem, we describe practical data generation algorithms for some popular ontology languages, and present some very encouraging results from our preliminary evaluation.

Link this page

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

Reviews and comments:

Comment1 george, May 25, 2013 at 3:59 p.m.:

please link the slides

Write your own review or comment:

make sure you have javascript enabled or clear this field: