Axiomatization of Aggregates in Answer Set Programming

被引：0
作者：
Fandinno, Jorge [1 ]
Hansen, Zachary [1 ]
Lierler, Yuliya [1 ]
机构：
[1] Univ Nebraska, Omaha, NE 68182 USA
来源：
THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2022年
关键词：
VICIOUS CIRCLE PRINCIPLE; LOGIC-PROGRAMS; INTENSIONAL SETS; SEMANTICS; ASP;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The paper presents a characterization of logic programs with aggregates based on a many-sorted generalization of operator SM that refers neither to grounding nor to fixpoints. This characterization introduces new function symbols for aggregate operations and aggregate elements, whose meaning can be fixed by adding appropriate axioms to the result of the SM transformation. We prove that for programs without positive recursion through aggregates our semantics coincides with the semantics of the answer set solver dingo.
引用
收藏
页码：5634 / 5641
页数：8
相关论文
共 23 条
[1]   Modular Answer Set Programming as a Formal Specification Language [J].
Cabalar, Pedro ;
Fandinno, Jorge ;
Lierler, Yuliya .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (05) :767-782
[2]   Gelfond-Zhang aggregates as propositional formulas [J].
Cabalar, Pedro ;
Fandinno, Jorge ;
Schaub, Torsten ;
Schellhorn, Sebastian .
ARTIFICIAL INTELLIGENCE, 2019, 274 :26-43
[3]   Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates [J].
Cabalar, Pedro ;
Fadinno, Jorge ;
Del Cerro, Luis Farinas ;
Pearce, David .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2018, 18 (3-4) :390-405
[4]   Functional answer set programming [J].
Cabalar, Pedro .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2011, 11 :203-233
[5]  
Calimeri F., 2012, Asp-core-2: Input language format
[6]   Intensional sets in CLP [J].
Dovier, A ;
Pontelli, E ;
Rossi, G .
LOGIC PROGRAMMING, PROCEEDINGS, 2003, 2916 :284-299
[7]  
DUTTINE A, 2008, REDUCTIVE SEMANTICS, P475
[8]   Semantics and complexity of recursive aggregates in answer set programming [J].
Faber, Wolfgang ;
Pfeifer, Gerald ;
Leone, Nicola .
ARTIFICIAL INTELLIGENCE, 2011, 175 (01) :278-298
[9]   Verifying Tight Logic Programs with ANTHEM and VAMPIRE [J].
Fandinno, Jorge ;
Lifschitz, Vladimir ;
Luehne, Patrick ;
Schaub, Torsten .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (05) :735-750
[10]   Logic Programs with Propositional Connectives and Aggregates [J].
Ferraris, Paolo .
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (04) :1-40
123