arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.13138cs.AIcs.LO
收藏

使用递归质量度量为描述逻辑蕴涵寻找好的证明(扩展技术报告)

Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)

TU Dresden(德累斯顿工业大学)

Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova

摘要:

基于逻辑的人工智能方法的优势在于,它们的行为原则上可以向用户解释。例如,如果一个描述逻辑推理器推导出一个触发整个系统的某个动作的结果,那么人们可以通过在适当的演算中给出该结果的证明来解释这样的蕴涵。如何理解这样的证明不仅取决于所采用的演算,而且还取决于特定证明的属性,例如其整体大小,其深度,所采用的句子和证明步骤的复杂性等。一个给定的证明质量的措施。而不是调查这个问题的一个固定的证明演算和一个固定的措施,我们的目标是一般的结果,持有广泛的类演算和措施。在以前的工作中,我们首先将注意力限制在使用证明大小来衡量证明质量的设置上。然后,我们将该方法扩展到更一般的设置,但没有涵盖证明深度等重要措施。在本文中,我们提供的一类措施称为递归的结果,产生较低的复杂性,也包括证明深度。此外,我们填补了我们以前的工作中留下的一些空白,从而提供了复杂性景观的全面画面。

英文摘要:

Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence that triggers some action of the overall system, then one can explain such an entailment by presenting a proof of the consequence in an appropriate calculus. How comprehensible such a proof is depends not only on the employed calculus, but also on the properties of the particular proof, such as its overall size, its depth, the complexity of the employed sentences and proof steps, etc. For this reason, we want to determine the complexity of generating proofs that are below a certain threshold w.r.t. a given measure of proof quality. Rather than investigating this problem for a fixed proof calculus and a fixed measure, we aim for general results that hold for wide classes of calculi and measures. In previous work, we first restricted the attention to a setting where proof size is used to measure the quality of a proof. We then extended the approach to a more general setting, but important measures such as proof depth were not covered. In the present paper, we provide results for a class of measures called recursive, which yields lower complexities and also encompasses proof depth. In addition, we close some gaps left open in our previous work, thus providing a comprehensive picture of the complexity landscape.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑