Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0
复制标题
描述逻辑中的近似:加权树自动机如何帮助定义 FL_0 中所需的概念比较度量
DOI:
10.1007/978-3-319-53733-7_1
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
Pavlos Marantidis
中科院分区:
文献类型:
--
作者:
Franz Baader;Oliver Fernández Gil;Pavlos Marantidis
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 forthat are equivalence invariant w.r.t. general TBoxes. This is a first step towards employing such measures in the mentioned approximation approaches.
登录
查看更多内容
DOI:
10.1109/incos.2013.77
发表时间:
2013
期刊:
2013 5th International Conference on Intelligent Networking and Collaborative Systems
影响因子:
--
作者:
B. Suntisrivaraporn
通讯作者:
B. Suntisrivaraporn
DOI:
--
发表时间:
2015
期刊:
2015 6th International Conference of Information and Communication Technology for Embedded Systems (IC-ICTES)
影响因子:
--
作者:
Teeradaj Racharak;B. Suntisrivaraporn
通讯作者:
B. Suntisrivaraporn
DOI:
--
发表时间:
2006
期刊:
TOCL
影响因子:
--
作者:
F. Wolter;M. Zakharyaschev
通讯作者:
M. Zakharyaschev
DOI:
--
发表时间:
2001
期刊:
影响因子:
--
作者:
Ralf Küsters
通讯作者:
Ralf Küsters
DOI:
--
发表时间:
2009
期刊:
Description Logics
影响因子:
--
作者:
F. Baader;Barbara Morawska
通讯作者:
Barbara Morawska