GASP: Answer Set Programming with Lazy Grounding
GASP: Answer Set Programming with Lazy Grounding
复制标题
GASP：使用惰性接地的答案集编程
作者：
A. D. Palù;A. Dovier;Enrico Pontelli;G. Rossi
近年来，答案集编程作为知识表示和推理应用的可行范例而受到欢迎。本文提出了一种新的方法来计算答案集程序的答案集。所提出的方法保持了自下而上的方法来计算答案集（如在现有的系统中），但它利用了一种新的结构的计算，这源于非地面版本的程序。在答案集的计算期间，延迟执行接地。该实现已实现使用约束逻辑编程在有限域。
In recent years, Answer Set Programming has gained popularity as a viable paradigm for applications in knowledge representation and reasoning. This paper presents a novel methodology to compute answer sets of an answer set program. The proposed methodology maintains a bottom-up approach to the computation of answer sets (as in existing systems), but it makes use of a novel structuring of the computation, that originates from the non-ground version of the program. Grounding is lazily performed during the computation of the answer sets. The implementation has been realized using Constraint Logic Programming over finite domains.