论文标题
ASP（AC）：带代数约束的答案集编程
ASP(AC): Answer Set Programming with Algebraic Constraints
论文作者
论文摘要
加权逻辑是对依赖定性信息的半段计算规范的强大工具。使用加权逻辑和此处（HT）逻辑的新型组合，其中这种依赖性基于直觉的理由，我们介绍了带有代数约束（ASP（ASP（AC））的答案集编程，其中规则可能包含将值进行半尿值与加权公式评估进行比较的约束。这些约束提供了对ASP中可用构造的一系列构造的精简访问，例如聚合，选择约束和算术运算符。他们扩展了其中的一些，并提供了一个通用框架，用于定义代数计算的程序，可以用来有效地使用，例如用于数据编写程序的出处语义。虽然通常不可确定，但可以利用ASP（AC）的表达性碎片在丰富的框架中进行有效解决问题。这项工作正在考虑逻辑编程的理论和实践中接受。
Weighted Logic is a powerful tool for the specification of calculations over semirings that depend on qualitative information. Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce Answer Set Programming with Algebraic Constraints (ASP(AC)), where rules may contain constraints that compare semiring values to weighted formula evaluations. Such constraints provide streamlined access to a manifold of constructs available in ASP, like aggregates, choice constraints, and arithmetic operators. They extend some of them and provide a generic framework for defining programs with algebraic computation, which can be fruitfully used e.g. for provenance semantics of datalog programs. While undecidable in general, expressive fragments of ASP(AC) can be exploited for effective problem-solving in a rich framework. This work is under consideration for acceptance in Theory and Practice of Logic Programming.
