Goal-Directed Tracing of Inferences in EL Ontologies

author: Pavel Klinov, Institute of Artificial Intelligence, Ulm University
published: Dec. 19, 2014,   recorded: October 2014,   views: 1837


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.


ELis a family of tractable Description Logics (DLs) that is the basis of the OWL 2 EL profile. Unlike for many expressive DLs, reasoning inELcan be performed by computing a deductively-closed set of logical consequences of some specific form. In some ontology-based applications, e.g., for ontology de- bugging, knowing the logical consequences of the ontology axioms is often not sufficient. The user also needs to know from which axioms and how the consequences were derived. Although it is possible to record all inference steps during the application of rules, this is usually not done in practice to avoid the overheads. In this paper, we present a goal-directed method that can generate inferences for selectedconsequencesinthedeductiveclosurewithoutre-applyingallrulesfrom scratch.Weprovideanempiricalevaluationdemonstratingthatthemethodisfast and economical for large ELontologies. Although the main benefits are demonstrated for EL reasoning, the method can be potentially applied to many other procedures based on deductive closure computation using fixed sets of rules.

See Also:

Download slides icon Download slides: iswc2014_klinov_interences_01.pdf (668.1 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: