Chain answer sets for logic programs with generalized atoms

DOI10.1007/978-3-030-19570-0_30MaRDI QIDQ2296731zbMATH OpenOpenAlexFDO

Authors M. Alviano, Wolfgang Faber

Publication date 18 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-19570-0_30

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Supportedly stable answer sets for logic programs with generalized atoms
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• Answer sets for logic programs with arbitrary abstract constraint atoms
• Well-supported semantics for logic programs with generalized rules
• Stable models of formulas with generalized quantifiers (preliminary report)

Cited in

(7)

• Supportedly stable 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
• scientific article; zbMATH DE number 5176700 (Why is no real title available?)
• Stable models of formulas with generalized quantifiers (preliminary report)
• Foundations of Information and Knowledge Systems
• Aggregate semantics for propositional answer set programs

Describes a project that uses

Uses Software

• WASP
• DLV

This page was built for publication: Chain 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 Q2296731)