.png){kind=icon}
返回
Query inseparability for ALC ontologies
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2018.09.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate the problem whether two ALC ontologies are indistinguishable (or inseparable) by means of queries in a given signature, which is fundamental for ontology engineering tasks such as ontology versioning, modularisation, update, and forgetting. We consider both knowledge base (KB) and TBox inseparability. For KBs, we give model-theoretic criteria in terms of (finite partial) homomorphisms and products and prove that this problem is undecidable for conjunctive queries (CQs), but 2ExpTIME-complete for unions of CQs (UCQs). The same results hold if (U)CQs are replaced by rooted (U)CQs, where every variable is connected to an answer variable. We also show that inseparability by CQs is still undecidable if one KB is given in the lightweight DL epsilon L and if no restrictions are imposed on the signature of the CQs. We also consider the problem whether two ALC TBoxes give the same answers to any query over any ABox in a given signature and show that, for CQs, this problem is undecidable, too. We then develop model-theoretic criteria for Horn ALC TBoxes and show using tree automata that, in contrast, inseparability becomes decidable and 2ExPTIME-complete, even ExpTimE-complete when restricted to (unions of) rooted CQs. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Description logic
Knowledge base
Conjunctive query
Query inseparability
Computational complexity
Tree automaton
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
An Investigation on the Etiology and Characterization of Fungal Diseases of Gerbera关于向日葵属真菌病害病因及特征的研究
OAAI
OAAI分享收藏
查看更多内容