arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.5859cs.LOcs.AI
收藏

关于求次佳溯因推理的复杂性

On the Complexity of Finding Second-Best Abductive Explanations

DIAG - Sapienza University of Rome(罗马大学DIAG)

Paolo Liberatore, Marco Schaerf

摘要:

在寻找一组给定的表现形式的溯因解释时,往往假设可能的解决方案之间的顺序。找到/验证最优解的复杂性是已知的。在本文中,我们考虑的计算复杂性找到次优解。我们考虑了不同的排序,也考虑了次优解的不同可能定义。

英文摘要:

While looking for abductive explanations of a given set of manifestations, an ordering between possible solutions is often assumed. The complexity of finding/verifying optimal solutions is already known. In this paper we consider the computational complexity of finding second-best solutions. We consider different orderings, and consider also different possible definitions of what a second-best solution is.

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

↑