Ordered completion for logic programs with aggregates
From MaRDI portal
Publication:892233
DOI10.1016/j.artint.2015.03.007zbMath1343.68043OpenAlexW2169055058MaRDI QIDQ892233
Publication date: 18 November 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2015.03.007
Related Items (4)
A progression semantics for first-order logic programs ⋮ Paracoherent answer set computation ⋮ Determining inference semantics for disjunctive logic programs ⋮ First-order stable model semantics with intensional functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered completion for first-order logic programs on finite structures
- Stable models and circumscription
- Semantics and complexity of recursive aggregates in answer set programming
- Extending and implementing the stable model semantics
- Logic programs with stable model semantics as a constraint programming paradigm
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Logic programs with propositional connectives and aggregates
- Well-founded and stable semantics of logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- Design and implementation of aggregate functions in the DLV system
- On Reductive Semantics of Aggregates in Answer Set Programming
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Modular Nonmonotonic Logic Programming Revisited
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- On the Complexity of Answer Set Programming with Aggregates
- Logic for Programming, Artificial Intelligence, and Reasoning
This page was built for publication: Ordered completion for logic programs with aggregates
