Matching with Respect to General Concept Inclusions in the Description Logic EL
Matching with Respect to General Concept Inclusions in the Description Logic EL
复制标题
相对于描述逻辑 EL 中包含的一般概念进行匹配
DOI:
10.1007/978-3-319-11206-0_14
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Barbara Morawska
中科院分区:
文献类型:
--
作者:
Franz Baader;Barbara Morawska
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL, it was shown in 2000 that matching without a TBox is NP-complete. In this paper we show that matching inw.r.t. general TBoxes (i.e., finite sets of general concept inclusions, GCIs) is in NP by introducing a goal-oriented matching algorithm that uses non-deterministic rules to transform a given matching problem into a solved form by a polynomial number of rule applications. We also investigate some tractable variants of the matching problem w.r.t. general TBoxes.
登录
查看更多内容
DOI:
--
发表时间:
2012
期刊:
Lecture Notes in Computer Science
影响因子:
--
作者:
M. Thielscher;Dongmo Zhang
通讯作者:
Dongmo Zhang
DOI:
10.7282/t3nc64tg
发表时间:
1999-08
期刊:
--
影响因子:
--
作者:
Alexander Borgida;Ralf Küsters
通讯作者:
Alexander Borgida;Ralf Küsters
DOI:
--
发表时间:
2012
期刊:
Australasian Conference on Artificial Intelligence
影响因子:
--
作者:
F. Baader;Stefan Borgwardt;Barbara Morawska
通讯作者:
Barbara Morawska
DOI:
--
发表时间:
2009
期刊:
Description Logics
影响因子:
--
作者:
F. Baader;Barbara Morawska
通讯作者:
Barbara Morawska
DOI:
--
发表时间:
1999
期刊:
Description Logics
影响因子:
--
作者:
F. Baader;Ralf Küsters
通讯作者:
Ralf Küsters