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

如何拆分逻辑程序

How to Split a Logic Program

Azrieli College of Engineering(阿兹列里工程学院)

Rachel Ben-Eliyahu-Zohary

摘要:

答案集编程(ASP)是解决一系列实际应用的成功方法。尽管快速ASP求解器的可用性,计算答案集需要非常大的计算能力,因为解决的问题是在多项式层次结构的第二层。如果程序可以分成两个不相交的部分,底部和顶部,则可以实现答案集计算的加速。因此,底部部分独立于顶部部分被评估,并且底部部分评估的结果用于简化顶部部分。Lifschitz和Turner引入了分裂集的概念,即,一组定义分裂的原子。本文证明了计算具有某些理想性质的分裂集的问题可以归结为一个经典的搜索问题,并在多项式时间内求解。这使我们能够在各种程序中对分裂集的大小进行实验,并导致一个有趣的发现,即稳定模型计算中的复杂性来源。我们还表明,头周期自由的程序,分裂集的定义可以调整,以允许分裂更广泛的一类程序。

英文摘要:

Answer Set Programming (ASP) is a successful method for solving a range of real-world applications. Despite the availability of fast ASP solvers, computing answer sets demands a very large computational power, since the problem tackled is in the second level of the polynomial hierarchy. A speed-up in answer set computation may be attained, if the program can be split into two disjoint parts, bottom and top. Thus, the bottom part is evaluated independently of the top part, and the results of the bottom part evaluation are used to simplify the top part. Lifschitz and Turner have introduced the concept of a splitting set, i.e., a set of atoms that defines the splitting. In this paper, We show that the problem of computing a splitting set with some desirable properties can be reduced to a classic Search Problem and solved in polynomial time. This allows us to conduct experiments on the size of the splitting set in various programs and lead to an interesting discovery of a source of complication in stable model computation. We also show that for Head-Cycle-Free programs, the definition of splitting sets can be adjusted to allow splitting of a broader class of programs.

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

↑