Aggregates in Answer Set Programming

被引：14
作者：
Alviano M. [1 ]
Faber W. [2 ]
机构：
[1] DEMACS, University of Calabria, Rende
[2] AINF, Alpen-Adria-Universität Klagenfurt, Klagenfurt
来源：
KI - Künstliche Intelligenz | 2018年 / 32卷 / 2-3期
基金：
欧盟地平线“2020”;
关键词：
Answer set programming; Nonmonotonic reasoning; Recursive aggregates;
D O I：
10.1007/s13218-018-0545-9
中图分类号：
学科分类号：
摘要：
Aggregates are among the most important linguistic extensions of Answer Set Programming (ASP), allowing for compact representations of properties and inductive definitions involving sets of propositions. Common use cases of aggregates in ASP are reported in this paper, which mainly focus on the semantics implemented by mainstream solvers, namely the F-stable model semantics. Other well-established semantics are also briefly discussed, providing a historical perspective on the foundation of logic programs with aggregates. © 2018, Springer-Verlag GmbH Germany, part of Springer Nature.
引用
收藏
页码：119 / 124
页数：5
相关论文
共 41 条
[1]  
Alviano M., Evaluating answer set programming with non-convex recursive aggregates, Fundam Inform, 149, 1-2, pp. 1-34, (2016)
[2]  
Alviano M., Calimeri F., Dodaro C., Fusca D., Leone N., Perri S., Ricca F., Veltri P., Zangari J., The ASP system DLV2, Logic Programming and Nonmonotonic reasoning—14th International Conference, LPNMR 2017, 10377, pp. 215-221, (2017)
[3]  
Alviano M., Dodaro C., Leone N., Ricca F., Advances in WASP, Logic Programming and Nonmonotonic reasoning—13th International Conference, LPNMR 2015, 9345, pp. 40-54, (2015)
[4]  
Alviano M., Faber W., The complexity boundary of answer set programming with generalized atoms under the FLP semantics, Logic Programming and Nonmonotonic Reasoning, 12Th International Conference, LPNMR 2013, Corunna, Spain, September 15–19, 2013. Proceedings, Lecture Notes in Computer Science, 8148, pp. 67-72, (2013)
[5]  
Alviano M., Faber W., Supportedly stable answer sets for logic programs with generalized atoms, Web Reasoning and Rule systems—9th International Conference, RR 2015, Berlin, Germany, August 4–5, 2015, Proceedings, Lecture Notes in Computer Science, 9209, pp. 30-44, (2015)
[6]  
Alviano M., Faber W., Gebser M., Rewriting recursive aggregates in answer set programming: back to monotonicity, TPLP, 15, 4-5, pp. 559-573, (2015)
[7]  
Alviano M., Faber W., Gebser M., From non-convex aggregates to monotone aggregates in ASP, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp. 4100-4194, (2016)
[8]  
Alviano M., Faber W., Leone N., Perri S., Pfeifer G., Terracina G., The disjunctive datalog system DLV, Datalog reloaded—first International Workshop, Datalog 2010, Oxford, UK, March 16–19, 2010. Revised Selected Papers, Lecture Notes in Computer Science, 6702, pp. 282-301, (2010)
[9]  
Alviano M., Faber W., Strass H., Boolean functions with ordered domains in answer set programming, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 879-885, (2016)
[10]  
Alviano M., Leone N., Complexity and compilation of gz-aggregates in answer set programming, TPLP, 15, 4-5, pp. 574-587, (2015)
12345