Axiomatizing $\mathcal{E\!L}^{\bot}_{\mathrm{gfp
$-General Concept Inclusions in the Presence of Untrusted Individuals |Year=2013 |Month=July |Booktitle=Proceedings of the 26th International Workshop on Description Logics ({DL-2013}) |Editor= |Note= |Organization= |Pages=65--79 |Publisher=CEUR-WS.org |Series=CEUR Workshop Proceedings |Volume=1014 |To appear=0
}}
Axiomatizing $\mathcal{E\!L}^{\bot}_{\mathrm{gfp
Daniel BorchmannDaniel Borchmann
Axiomatizing $\mathcal{E\!L}^{\bot}_{\mathrm{gfp
- KurzfassungAbstract
To extract terminological knowledge from data, Baader and Distel have proposed aneffective method that allows for the extraction of a base of all valid general concept inclusions of a given finite interpretation. In previous works, to be able to handle small amounts of errors in our data, we have extended this approach to also extract general concept inclusions which are ``almost valid in the interpretation. This has been done by demanding that general concept inclusions which are ``almost valid are those having only an allowed percentage of counterexamples in the interpretation. In this work, we shall further extend our previous work to allow the interpretation to contain both trusted and untrusted individuals, i.e. individuals from which we know and do not know that they are correct, respectively. The problem we then want to solve is to find a compact representation of all terminological knowledge that is valid for all trusted
individuals and is almost valid for all others. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Borc-DL13,
author = {Daniel {Borchmann}},
booktitle = {Proceedings of the 26th International Workshop on Description Logics ({DL-2013})},
month = {July},
pages = {65--79},
publisher = {CEUR-WS.org},
series = {CEUR Workshop Proceedings},
title = {Axiomatizing $\mathcal{E\!L}^{\bot}_{\mathrm{gfp}}$-General Concept Inclusions in the Presence of Untrusted Individuals},
venue = {Ulm, Germany},
volume = {1014},
year = {2013},
}
