Logic programs with propositional connectives and aggregates
From MaRDI portal
Abstract: Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. Aggregates are an ASP construct that plays an important role in many applications. Defining a satisfactory semantics of aggregates turned out to be a difficult problem, and in this paper we propose a new approach, based on an analogy between aggregates and propositional connectives. First, we extend the definition of an answer set/stable model to cover arbitrary propositional theories; then we define aggregates on top of them both as primitive constructs and as abbreviations for formulas. Our definition of an aggregate combines expressiveness and simplicity, and it inherits many theorems about programs with nested expressions, such as theorems about strong equivalence and splitting.
Recommendations
Cited in
(37)- The possibilistic Horn non-clausal knowledge bases
- Recursive rules with aggregation: a simple unified semantics
- Complexity results for probabilistic answer set programming
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Supportedly stable answer sets for logic programs with generalized atoms
- Automated reasoning with restricted intensional sets
- Vicious circle principle and logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- LP with flexible grouping and aggregates using modes
- Shared aggregate sets in answer set programming
- Functional ASP with intensional sets: application to Gelfond-Zhang aggregates
- Translating LPOD and CR-\(\mathrm{Prolog}_2\) into standard answer set programs
- 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
- Stepwise debugging of answer-set programs
- Unsatisfiable core analysis and aggregates for optimum stable model search
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Enhancing magic sets with an application to ontological reasoning
- Inconsistency proofs for ASP: the ASP-DRUPE format
- Modular answer set programming as a formal specification language
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
- Predicate-calculus-based logics for modeling and solving search problems
- Logic Programming
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Semantics and complexity of recursive aggregates in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Gelfond-Zhang aggregates as propositional formulas
- Gelfond-Zhang aggregates as propositional formulas
- Bounded satisfiability checking of \(\mathrm{FOL}^*\) formulas with aggregations
- On the foundations of grounding in answer set programming
- Aggregate semantics for propositional answer set programs
- The loop formula based semantics of description logic programs
- Ordered completion for logic programs with aggregates
This page was built for publication: Logic programs with propositional connectives and aggregates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946644)
