Vicious circle principle and logic programs with aggregates

DOI10.1017/S1471068414000222MaRDI QIDQ2931266zbMATH OpenFDO

Authors Yuanlin Zhang, Michael Gelfond

Publication date 25 November 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.3637

zbMATH Keywords

aggregatesanswer set programmingknowledge representation language

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30)

Abstract: The paper presents a knowledge representation language $mathcalAlog$ which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some properties of $mathcalAlog$, an algorithm for computing its answer sets, and comparison with other approaches.

Recommendations

• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Vicious circle principle and formation of sets in ASP based languages
• Logics in Artificial Intelligence
• Logic programs with propositional connectives and aggregates
• Semantics and complexity of recursive aggregates in answer set programming

Cites work

• A Constructive semantic characterization of aggregates in answer set programming
• Enhancing disjunctive logic programming systems by SAT checkers
• Extending and implementing the stable model semantics
• Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
• Logic programs with abstract constraint atoms: the role of computations
• Semantics and complexity of recursive aggregates in answer set programming
• The DLV system for knowledge representation and reasoning

Cited in

(23)

• Recursive rules with aggregation: a simple unified semantics
• Complexity results for probabilistic answer set programming
• P-log: refinement and a new coherency condition
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Vicious circle principle and formation of sets in ASP based languages
• Shared aggregate sets in answer set programming
• Functional ASP with intensional sets: application to Gelfond-Zhang aggregates
• Scaling-up reasoning and advanced analytics on BigData
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• Complexity and compilation of GZ-aggregates in answer set programming
• Anytime answer set optimization via unsatisfiable core shrinking
• <scp>Core</scp>ALM<scp>lib</scp>: An library translated from the <scp>Component Library</scp>
• ASP-Core-2 input language format
• scientific article; zbMATH DE number 7455719 (Why is no real title available?)
• Enhancing magic sets with an application to ontological reasoning
• Inconsistency proofs for ASP: the ASP-DRUPE format
• Relating two dialects of answer set programming
• \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
• A compositional typed higher-order logic with definitions
• Gelfond-Zhang aggregates as propositional formulas
• Logic, accountability and design (extended abstract)
• Grounded fixpoints and their applications in knowledge representation

This page was built for publication: Vicious circle principle and logic programs with aggregates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931266)