带聚合的递归规则:一种简单的统一语义
Recursive Rules with Aggregation: A Simple Unified Semantics
AI总结:
针对带聚合的递归规则语义定义难、现有方案不兼容的问题,本文扩展带否定递归规则的统一语义,提出支持不同假设、正交解释聚合操作的统一语义,经形式化验证与多类示例测试,其结果准确且性能优于知名系统。
摘要:
复杂推理问题可通过逻辑规则最清晰、最简便地描述,但在实际应用中需要用到带count(计数)、sum(求和)等聚合操作的递归规则。遗憾的是,这类规则的语义定义一直是重大难题,导致出现了诸多互不兼容的语义方案。\n本文提出了一种带聚合的递归规则的统一语义,扩展了针对带否定的递归规则的统一有基语义(founded semantics)与约束语义(constraint semantics)。其核心思路是支持简单表达不同语义背后的各类假设,并以聚合操作常规的简单含义对其进行正交解释。我们给出了该语义的形式化定义,证明了其重要性质,并与现有语义进行了对比。具体而言,我们提出了一种高效的聚合推理方法,对文献中所有已研究的示例都能给出精确答案。我们还将该语义应用于大量具有挑战性的示例,结果表明该语义简洁易懂,且在所有案例中都能得到预期结果。最后,我们在最具挑战性的示例上开展了实验,结果显示,在知名系统能够计算出正确答案的情况下,我们的方法表现出了意料之外的优越性能。
英文摘要:
Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a significant challenge, leading to many disagreeing semantics. This paper describes a unified semantics for recursive rules with aggregation, extending the unified founded semantics and constraint semantics for recursive rules with negation. The key idea is to support simple expression of the different assumptions underlying different semantics, and orthogonally interpret aggregation operations using their simple usual meaning. We present a formal definition of the semantics, prove important properties of the semantics, and compare with prior semantics. In particular, we present an efficient inference over aggregation that gives precise answers to all examples we have studied from the literature. We also apply our semantics to a wide range of challenging examples, and show that our semantics is simple and matches the desired results in all cases. Finally, we describe experiments on the most challenging examples, exhibiting unexpectedly superior performance over well-known systems when they can compute correct answers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。