Supportedly stable answer sets for logic programs with generalized atoms

DOI10.1007/978-3-319-22002-4_4zbMath1365.68147OpenAlexW1174953579MaRDI QIDQ2360180

Wolfgang Faber, Mario Alviano

Publication date: 26 June 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-22002-4_4

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Conflict-driven answer set solving: from theory to practice
• Combining answer set programming with description logics for the semantic web
• FLP answer set semantics without circular justifications for general logic programs
• External sources of knowledge and value invention in logic programming
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• Anytime Computation of Cautious Consequences in Answer Set Programming
• 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
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Supportedly stable answer sets for logic programs with generalized atoms