In the work of Baader and Distel, a method has been proposed to axiomatize all general concept inclusions (GCIs) expressible in the description logic EL⊥ and valid in a given interpretation I. This provides us with an effective method to learn EL⊥-ontologies from interpretations, which itself can be seen as a different representation of linked data. In another report, we have extended this approach to handle errors in the data. This has been done by not only considering valid GCIs but also those whose confidence is above a certain threshold 𝑐. In the present work, we shall extend the results by describing another way to compute bases of confident GCIs. We furthermore provide experimental evidence that this approach can be useful for practical applications. We finally show that the technique of unravelling can also be used to effectively turn confident EL⊥gfp-bases into EL⊥-bases.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:79532 |
| Date | 16 June 2022 |
| Creators | Borchmann, Daniel |
| Publisher | Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504 |
Page generated in 0.0017 seconds