Supportedly stable answer sets for logic programs with generalized atoms
From MaRDI portal
Publication:2360180
DOI10.1007/978-3-319-22002-4_4zbMATH Open1365.68147OpenAlexW1174953579MaRDI QIDQ2360180FDOQ2360180
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
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
- External sources of knowledge and value invention in logic programming
- Combining answer set programming with description logics for the semantic web
- Semantics and complexity of recursive aggregates in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Conflict-driven answer set solving: from theory to practice
- FLP answer set semantics without circular justifications for general logic programs
- Extending the Smodels system with cardinality and weight constraints
- 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
- Title not available (Why is that?)
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Properties and applications of programs with monotone and convex constraints
- Logic programs with propositional connectives and aggregates
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Anytime computation of cautious consequences in answer set programming
Cited In (6)
- Stability, supportedness, minimality and Kleene answer set programs
- Stable models of formulas with generalized quantifiers (preliminary report)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Chain answer sets for logic programs with generalized atoms
- Well-supported semantics for logic programs with generalized rules
- 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)
