We present a scheme for translating logic programs, which may use aggregation and arithmetic, into algebraic expressions that denote bag relations over ground terms of the Herbrand universe. To evaluate queries against these relations, we develop an operational semantics based on term rewriting of the algebraic expressions. This approach can exploit arithmetic identities and recovers a range of useful strategies, including lazy strategies that defer work until it becomes possible or necessary.

中文翻译：

---

具有内置和聚合的逻辑程序的评估：袋关系的演算

我们提出了一个方案，用于将可能使用聚合和算术的逻辑程序翻译成代数表达式，这些表达式表示 Herbrand 宇宙的基本项上的包关系。为了评估针对这些关系的查询，我们开发了一种基于代数表达式的术语重写的操作语义。这种方法可以利用算术恒等式并恢复一系列有用的策略，包括延迟工作直到成为可能或必要的惰性策略。