Supportedly stable answer sets for logic programs with generalized atoms

DOI10.1007/978-3-319-22002-4_4MaRDI QIDQ2360180zbMATH OpenOpenAlexFDO

Authors M. Alviano, Wolfgang Faber

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)

Recommendations

• Chain answer sets for logic programs with generalized atoms
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• Well-supported semantics for logic programs with generalized rules
• Stability, supportedness, minimality and Kleene answer set programs
• Answer sets for logic programs with arbitrary abstract constraint atoms

Cites work

• scientific article; zbMATH DE number 1453071 (Why is no real title available?)
• A Constructive semantic characterization of aggregates in answer set programming
• Anytime computation of cautious consequences in answer set programming
• Combining answer set programming with description logics for the semantic web
• Conflict-driven answer set solving: from theory to practice
• Design and implementation of aggregate functions in the DLV system
• Extending the Smodels system with cardinality and weight constraints
• External sources of knowledge and value invention in logic programming
• FLP answer set semantics without circular justifications for general logic programs
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with propositional connectives and aggregates
• Logics in Artificial Intelligence
• Properties and applications of programs with monotone and convex constraints
• Semantics and complexity of recursive aggregates in answer set programming
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• Well-founded and stable semantics of logic programs with aggregates

Cited in

(6)

• Stable models of formulas with generalized quantifiers (preliminary report)
• Chain answer sets for logic programs with generalized atoms
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• Well-supported semantics for logic programs with generalized rules
• Stability, supportedness, minimality and Kleene answer set programs
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

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

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