arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.08229cs.AIcs.LO
收藏

具有隐命中集的命题溯因

Propositional Abduction with Implicit Hitting Sets

University of Lisbon(里斯本大学);Faculty of Science(理学院)

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva

摘要:

基于逻辑的溯因推理在人工智能及相关领域有着重要的应用。一个应用的例子是为观察到的现象寻找解释。命题溯因是溯因到命题域的限制,复杂度方面是多项式层次的第二层。最近的工作表明,利用隐式命中集和命题可满足性(SAT)求解器提供了一个有效的方法命题溯因。本文研究了这一早期的工作,并提出了一些算法的改进。这些改进表明,产生指数减少SAT求解器调用的数量。更重要的是,实验结果表明,显着的性能改善相比,最好的方法命题溯因。

英文摘要:

Logic-based abduction finds important applications in artificial intelligence and related areas. One application example is in finding explanations for observed phenomena. Propositional abduction is a restriction of abduction to the propositional domain, and complexity-wise is in the second level of the polynomial hierarchy. Recent work has shown that exploiting implicit hitting sets and propositional satisfiability (SAT) solvers provides an efficient approach for propositional abduction. This paper investigates this earlier work and proposes a number of algorithmic improvements. These improvements are shown to yield exponential reductions in the number of SAT solver calls. More importantly, the experimental results show significant performance improvements compared to the the best approaches for propositional abduction.

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

↑