arXiv:2412.17143cs.AI2024-12被引 9

让逻辑推理系统像接力赛一样持续运行,大幅提速复杂问题求解。

ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding

  • 基于增量接地机制,复用历史计算结果,避免重复从头开始
  • 在流式数据场景下,推理速度相比传统方法提升数倍以上
  • 对用户透明,适用于需要频繁响应的实时推理任务

DLV2 是一种支持答案集编程(ASP)的知识表示与推理工具,广泛应用于学术与工业场景。给定一个描述计算问题的逻辑程序,其执行会生成一一对应于问题解的答案集。传统计算流程采用“接地-求解”范式:先将输入程序转化为等价的无变量程序(接地),再通过命题算法搜索答案集。随着流式推理与事件处理等应用兴起,对多轮推理(multi-shot reasoning)的需求日益增长——系统需在快速变化的数据上反复响应。本文提出一种从 DLV2 演化而来的增量推理器,实现持续迭代推理。系统不再每次重置计算,而是保持状态,在各轮推理中增量更新内部接地过程。每轮利用先前计算成果构建并维护一个更大、更通用的接地程序,并从中提取出较小但等价的部分用于答案集计算。整个增量过程对用户完全透明。我们详细描述了系统架构、使用方式及其在若干实际场景中的适用性与性能表现。论文投稿至《Theory and Practice of Logic Programming》(TPLP)。

原文摘要 · Abstract (English)

DLV2 is an AI tool for Knowledge Representation and Reasoning which supports Answer Set Programming (ASP) - a logic-based declarative formalism, successfully used in both academic and industrial applications. Given a logic program modelling a computational problem, an execution of DLV2 produces the so-called answer sets that correspond one-to-one to the solutions to the problem at hand. The computational process of DLV2 relies on the typical Ground & Solve approach where the grounding step transforms the input program into a new, equivalent ground program, and the subsequent solving step applies propositional algorithms to search for the answer sets. Recently, emerging applications in contexts such as stream reasoning and event processing created a demand for multi-shot reasoning: here, the system is expected to be reactive while repeatedly executed over rapidly changing data. In this work, we present a new incremental reasoner obtained from the evolution of DLV2 towards iterated reasoning. Rather than restarting the computation from scratch, the system remains alive across repeated shots, and it incrementally handles the internal grounding process. At each shot, the system reuses previous computations for building and maintaining a large, more general ground program, from which a smaller yet equivalent portion is determined and used for computing answer sets. Notably, the incremental process is performed in a completely transparent fashion for the user. We describe the system, its usage, its applicability and performance in some practically relevant domains. Under consideration in Theory and Practice of Logic Programming (TPLP).

逻辑推理增量计算ASP多轮推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。