Cited By
View all- Gelfond MZhang Y(2019)Vicious circle principle, aggregates, and formation of sets in ASP based languagesArtificial Intelligence10.1016/j.artint.2019.04.004Online publication date: Apr-2019
Loop Formulas for Alog Answer Set Programs
Pages 38 - 42
Abstract
Logic programming based on answer set semantics, coined Answer Set Programming, is an important declarative problem solving paradigm. It has been widely used in various fields, such as artificial intelligence, bioinformatics, linguistics and so forth. Lin and Zhao's notion of loop formulas for normal logic programs provides not only a deep understanding for answer set semantics but also an alternative approach of computing answer sets in terms of satisfiability solvers. Gelfond and Zhang recently propose a new semantics -- Alog answer sets -- for logic programs with aggregates, that is a distinguishing extension for normal logic programs. This paper generalizes Lin and Zhao's loop formulas to these logic programs and shows that, together with completion, loop formulas can capture the new semantics. Thus, it provides an alternative understanding for this semantics and a potential approach of computing Alog answer sets.
References
[1]
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012.
[2]
Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Communications of the ACM, 54(12):92--103, 2011.
[3]
Martin Gebser, Marco Maratea, and Francesco Ricca. The sixth answer set programming competition. Journal of Artificial Intelligence Research, 60:41--95, 2017.
[4]
Wolfgang Faber, Gerald Pfeifer, and Nicola Leone. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence, 175(1):278--298, 2011.
[5]
Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In José Júlio Alferes and João Alexandre Leite, editors, Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings, volume 3229 of Lecture Notes in Computer Science, pages 200--212. Springer, 2004.
[6]
Paolo Ferraris. Answer sets for propositional theories. In Logic Programming and Nonmonotonic Reasoning, 8th International Conference, volume 3662 of Lecture Notes in Computer Science, pages 119--131, Diamante, Italy, 2005. Springer.
[7]
Tran Cao Son, Enrico Pontelli, and Phan Huy Tu. Answer sets for logic programs with arbitrary abstract constraint atoms. Journal of Artificial Intelligence Research, 29:353--389, 2007.
[8]
Joohyung Lee and Yunsong Meng. On reductive semantics of aggregates in answer set programming. In Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LP-NMR 2009, volume 5753 of Lecture Notes in Computer Science, pages 182--195, Potsdam, Germany, 2009. Springer.
[9]
Victor W. Marek and Miroslaw Truszczynski. Logic programs with abstract constraint atoms. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence (AAAI 2004), pages 86--91, San Jose, California, USA, 2004. AAAI Press.
[10]
Michael Gelfond and Yuanlin Zhang. Vicious circle principle and logic programs with aggregates. Theory and Practice of Logic Programming, 14(4-5):587--601, 2014.
[11]
Michael Gelfond and Yuanlin Zhang. Vicious circle principle and formation of sets in ASP based languages. In Marcello Balduccini and Tomi Janhunen, editors, Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Espoo, Finland, July 3-6, 2017, Proceedings, volume 10377 of Lecture Notes in Computer Science, pages 146--159. Springer, 2017.
[12]
Francesco Calimeri, Wolfgang Faber, Nicola Leone, and Simona Perri. Declarative and computational properties of logic programs with aggregates. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pages 406--411, Edinburgh, Scotland, UK, 2005. Professional Book Center.
[13]
Yuanlin Zhang and Maede Rayatidamavandi. A characterization of the semantics of logic programs with aggregates. In Subbarao Kambhampati, editor, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pages 1338--1344. IJCAI/AAAI Press, 2016.
[14]
Yin Chen, Fangzhen Lin, Yisong Wang, and Mingyi Zhang. First-order loop formulas for normal logic programs. In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pages 298--307, Lake District of the United Kingdom, 2006. AAAI Press.
Index Terms
- Loop Formulas for Alog Answer Set Programs
Recommendations
Loop formulas for circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with ''loop formulas'' so that general cases of nonmonotonic logics such as logic programs (...
From answer set logic programming to circumscription via logic of GK
We first embed Pearce's equilibrium logic and Ferraris's propositional general logic programs in Lin and Shoham's logic of GK, a nonmonotonic modal logic that has been shown to include as special cases both Reiter's default logic in the propositional ...
Loop formulas for description logic programs
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
December 2017
299 pages
ISBN:9781450353922
DOI:10.1145/3168390
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 December 2017
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
CSAI 2017
CSAI 2017: 2017 International Conference on Computer Science and Artificial Intelligence
December 5 - 7, 2017
Jakarta, Indonesia
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 57Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Nov 2024
Other Metrics
Citations
Cited By
View all- Gelfond MZhang Y(2019)Vicious circle principle, aggregates, and formation of sets in ASP based languagesArtificial Intelligence10.1016/j.artint.2019.04.004Online publication date: Apr-2019
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in