具有命题连接词和集合的逻辑程序
Logic programs with propositional connectives and aggregates
摘要：
答案集编程（ASP）是一种逻辑编程范式，可用于解决复杂的组合搜索问题。聚合是一种ASP构造，在许多应用程序中起着重要作用。定义一个令人满意的语义聚合原来是一个困难的问题，在本文中，我们提出了一个新的方法，基于聚合和命题连接词之间的类比。首先，我们扩展了答案集/稳定模型的定义，以涵盖任意命题理论;然后，我们将聚合定义为原始构造和公式的缩写。我们的集合的定义结合了表达性和简单性，它继承了许多关于嵌套表达式程序的定理，如强等价和分裂定理。
英文摘要：
Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. Aggregates are an ASP construct that plays an important role in many applications. Defining a satisfactory semantics of aggregates turned out to be a difficult problem, and in this paper we propose a new approach, based on an analogy between aggregates and propositional connectives. First, we extend the definition of an answer set/stable model to cover arbitrary propositional theories; then we define aggregates on top of them both as primitive constructs and as abbreviations for formulas. Our definition of an aggregate combines expressiveness and simplicity, and it inherits many theorems about programs with nested expressions, such as theorems about strong equivalence and splitting.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
