Living Without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
A. Artale, J. C. Jung, Andrea Mazzullo, A. Ozaki, F. Wolter
{"title":"Living Without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions","authors":"A. Artale, J. C. Jung, Andrea Mazzullo, A. Ozaki, F. Wolter","doi":"10.1145/3597301","DOIUrl":null,"url":null,"abstract":"The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit definability is valid. Thus, the CIP and PBDP reduce potentially hard existence problems to entailment in the underlying logic. Description (and modal) logics with nominals and/or role inclusions do not enjoy the CIP nor the PBDP, but interpolants and explicit definitions have many applications, in particular in concept learning, ontology engineering, and ontology-based data management. In this article we show that, even without Beth and Craig, the existence of interpolants and explicit definitions is decidable in description logics with nominals and/or role inclusions such as \\(\\mathcal {ALCO} \\) , \\(\\mathcal {ALCH} \\) and \\(\\mathcal {ALCHOI} \\) and corresponding hybrid modal logics. However, living without Beth and Craig makes these problems harder than entailment: the existence problems become 2ExpTime-complete in the presence of an ontology or the universal modality, and coNExpTime-complete otherwise. We also analyze explicit definition existence if all symbols (except the one that is defined) are admitted in the definition. In this case the complexity depends on whether one considers individual or concept names. Finally, we consider the problem of computing interpolants and explicit definitions if they exist and turn the complexity upper bound proof into an algorithm computing them, at least for description logics with role inclusions.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"1 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computational Logic","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3597301","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 2

Abstract

The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit definability is valid. Thus, the CIP and PBDP reduce potentially hard existence problems to entailment in the underlying logic. Description (and modal) logics with nominals and/or role inclusions do not enjoy the CIP nor the PBDP, but interpolants and explicit definitions have many applications, in particular in concept learning, ontology engineering, and ontology-based data management. In this article we show that, even without Beth and Craig, the existence of interpolants and explicit definitions is decidable in description logics with nominals and/or role inclusions such as \(\mathcal {ALCO} \) , \(\mathcal {ALCH} \) and \(\mathcal {ALCHOI} \) and corresponding hybrid modal logics. However, living without Beth and Craig makes these problems harder than entailment: the existence problems become 2ExpTime-complete in the presence of an ontology or the universal modality, and coNExpTime-complete otherwise. We also analyze explicit definition existence if all symbols (except the one that is defined) are admitted in the definition. In this case the complexity depends on whether one considers individual or concept names. Finally, we consider the problem of computing interpolants and explicit definitions if they exist and turn the complexity upper bound proof into an algorithm computing them, at least for description logics with role inclusions.
没有贝丝和克雷格的生活:名词和角色包含的描述和模态逻辑中的定义和插入
克雷格插值性质(CIP)表明,一个隐含的插值存在,只要它是有效的。投影贝丝可定义性(PBDP)表明,如果一个表述隐式可定义性的公式有效,则存在显式定义。因此,CIP和PBDP将潜在的硬存在问题减少到底层逻辑的蕴涵。带有标称和/或角色包含的描述(和模态)逻辑不享受CIP和PBDP,但是插值和显式定义有许多应用,特别是在概念学习、本体工程和基于本体的数据管理中。在这篇文章中,我们证明,即使没有Beth和Craig,在含有标称和/或角色包含的描述逻辑(如\(\mathcal {ALCO} \), \(\mathcal {ALCH} \)和\(\mathcal {ALCHOI} \))和相应的混合模态逻辑中,插值和显式定义的存在是可决定的。然而,没有Beth和Craig的生活使这些问题比蕴涵更难:存在问题在本体或普遍模态的存在下变成2ExpTime-complete,否则变成coNExpTime-complete。如果所有的符号(除了被定义的符号)在定义中被承认,我们也分析了显式定义的存在性。在这种情况下,复杂性取决于是否考虑单个名称或概念名称。最后,我们考虑计算插值和显式定义的问题,如果它们存在,并将复杂度上界证明转化为计算它们的算法,至少对于具有角色包含的描述逻辑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
37
审稿时长
>12 weeks
期刊介绍: TOCL welcomes submissions related to all aspects of logic as it pertains to topics in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, Dana Scott, Edmond M. Clarke, Allen E. Emerson, and Joseph Sifakis (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI). Logic continues to play an important role in computer science and has permeated several of its areas, including artificial intelligence, computational complexity, database systems, and programming languages. The Editorial Board of this journal seeks and hopes to attract high-quality submissions in all the above-mentioned areas of computational logic so that TOCL becomes the standard reference in the field. Both theoretical and applied papers are sought. Submissions showing novel use of logic in computer science are especially welcome.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信