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

在答案集程序中内联外部源

Inlining External Sources in Answer Set Programs

Vienna University of Technology(维也纳技术大学)

Christoph Redl

摘要:

HEX程序是带有外部源的答案集程序(ASP)的扩展。为此,外部原子在程序和外部源之间提供了一个双向接口。传统的HEX程序评价算法是基于猜测外部原子的真值,并通过外部源的显式调用来验证它们。该方法通过减少必要的验证调用数量或加快其速度的技术进行了优化,但剩余的外部调用仍然很昂贵。在本文中,我们提出了一种替代的评估方法的基础上内联的外部原子,现有的,但不太一般的专门的形式主义,如DL-程序的方法的动机。然后编译掉外部原子,这样就不需要验证调用。该方法在dlvhex reasoner中实现。实验表明,显着的性能增益。除了性能的改善,我们进一步利用内联扩展以前的(语义)表征的程序等价从ASP到HEX程序,包括强等价,一致等价和H,B -等价。最后,基于这些等价准则,我们还刻画了程序wrt的不一致性。extensions.由于众所周知的ASP扩展(如约束ASP)是HEX的特殊情况,结果是有趣的,超出了特定的形式主义。逻辑程序设计理论与实践(TPLP)

英文摘要:

HEX-programs are an extension of answer set programs (ASP) with external sources. To this end, external atoms provide a bidirectional interface between the program and an external source. The traditional evaluation algorithm for HEX-programs is based on guessing truth values of external atoms and verifying them by explicit calls of the external source. The approach was optimized by techniques that reduce the number of necessary verification calls or speed them up, but the remaining external calls are still expensive. In this paper we present an alternative evaluation approach based on inlining of external atoms, motivated by existing but less general approaches for specialized formalisms such as DL-programs. External atoms are then compiled away such that no verification calls are necessary. The approach is implemented in the dlvhex reasoner. Experiments show a significant performance gain. Besides performance improvements, we further exploit inlining for extending previous (semantic) characterizations of program equivalence from ASP to HEX-programs, including those of strong equivalence, uniform equivalence and H, B -equivalence. Finally, based on these equivalence criteria, we characterize also inconsistency of programs wrt. extensions. Since well-known ASP extensions (such as constraint ASP) are special cases of HEX, the results are interesting beyond the particular formalism. Under consideration in Theory and Practice of Logic Programming (TPLP).

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

↑