ASP程序的部分编译
Partial Compilation of ASP Programs
摘要:
答案集编程(ASP)是逻辑编程中一种著名的声明式形式主义。高效的实现使得ASP可以应用于许多场景,从演绎数据库应用程序到解决困难的组合问题。最先进的ASP系统基于传统的Ground\&Solve方法,并且是通用的实现,即,对于任何类型的输入程序,它们基本上都是一次性构建的。在本文中,我们提出了一个扩展的ASP系统架构,其中输入程序的部分被编译成一个ad-hoc评估算法(即,我们获得给定程序的特定二进制文件),并且可能不受基础步骤的影响。为此,我们确定了一个条件,允许编译的子程序,并提出了相关的部分编译技术。重要的是,我们已经实现了一个著名的ASP求解器上的新方法,并进行了公开的基准测试的实验分析。结果表明,我们的编译为基础的方法,提高了在各种情况下,包括输入程序分层或接地爆破的情况下,使传统的ASP系统的评估不切实际的最先进的。
英文摘要:
Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground\&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。