Matching in Description Logics with Existential Restrictions
Matching in Description Logics with Existential Restrictions
复制标题
描述逻辑与存在限制的匹配
DOI：
--
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
Ralf Küsters
中科院分区：
文献类型：
--
作者：
F. Baader;Ralf Küsters
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of description logics, originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. Previous work has concentrated on (sub-)languages of CLASSIC, which in particular do not allow for existential restrictions. In this work, we present sound and complete decision algorithms for the solvability of matching problems and for computing sets of matchers for matching problems in description logics with existential restrictions.
