Abstract
Recently introduced approaches for relaxed query answering, approximately defining concepts, and approximately solving unification problems in Description Logics have in common that they are based on the use of concept comparison measures together with a threshold construction. In this paper, we will briefly review these approaches, and then show how weighted automata working on infinite trees can be used to construct computable concept comparison measures for FL0 that are equivalence invariant w.r.t. general TBoxes. This is a first step towards employing such measures in the mentioned approximation approaches.
Cite
CITATION STYLE
Baader, F., Fernández Gil, O., & Marantidis, P. (2017). Approximation in description logics: How weighted tree automata can help to define the required concept comparison measures in FL0. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10168 LNCS, pp. 3–26). Springer Verlag. https://doi.org/10.1007/978-3-319-53733-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
