Effective computation of maximal sound approximations of Description Logic ontologies thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Effective computation of maximal sound approximations of Description Logic ontologies

Published on Dec 19, 20141670 Views

We study the problem of approximating Description Logic (DL) ontologies specified in a source language LS in terms of a less expressive target languageLT. This problem is getting very relevant in pract

Related categories

Chapter list

Effective computation of maximal sound approximations of Description Logic ontologies00:00
Ontology approximation00:16
Outline - 101:19
Outline - 201:53
Preliminaries01:58
Outline - 302:27
What we want when we approximate02:32
Ontology approximation03:30
Existence and Uniqueness04:27
A constructive notion of approximation05:26
A new notion of approximation06:50
k-approximation07:52
Two notable cases for k-approximation08:34
An example of GSA and LSA09:23
Outline - 409:57
k-approximation in OWL 2 QL09:58
Computing k-approximation in OWL 2 QL10:47
Outline - 511:03
Experimental evaluation - 111:04
Experimental evaluation - 213:07
Outline - 614:11
Conclusions and Future Work14:12
Thank you!14:53