Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
From MaRDI portal
Publication:4559801
DOI10.1017/S1471068418000169zbMath1451.68255arXiv1805.00660OpenAlexW2963165327MaRDI QIDQ4559801
No author found.
Publication date: 4 December 2018
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.00660
Related Items
Recursive rules with aggregation: a simple unified semantics, Automated reasoning with restricted intensional sets, Autoepistemic answer set programming, Gelfond-Zhang aggregates as propositional formulas, Vicious circle principle, aggregates, and formation of sets in ASP based languages
Uses Software
Cites Work
- Semantics and complexity of recursive aggregates in answer set programming
- Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
- Logic programming with sets
- Extending and implementing the stable model semantics
- Vicious Circle Principle and Logic Programs with Aggregates
- Logic programs with propositional connectives and aggregates
- Functional answer set programming
- Set constructors in a logic database language
- Well-founded and stable semantics of logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Program completion in the input language of GRINGO
- Logic Programming
- ASP with non-herbrand partial functions: a language and system for practical use
- Gelfond-Zhang aggregates as propositional formulas