Approved Models for Normal Logic Programs

DOI10.1007/978-3-540-75560-9_33zbMATHDBLPOpenAlexWikidataMaRDI QIDQ3498486FDO

Authors Luís Moniz Pereira, Alexandre Pinto

Publication date 15 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75560-9_33

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Short note preferred extensions are partial stable models
• On the equivalence of semantics for normal logic programs
• scientific article; zbMATH DE number 1114052
• Tight semantics for logic programs

Cites work

• scientific article; zbMATH DE number 741347 (Why is no real title available?)
• scientific article; zbMATH DE number 1931648 (Why is no real title available?)
• An abstract, argumentation-theoretic approach to default reasoning
• Dialectic proof procedures for assumption-based, admissible argumentation
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games

Cited in

(6)

• Paracoherent answer set semantics meets argumentation frameworks
• Better paracoherent answer sets with less resources
• Modular paracoherent answer sets
• Collaborative vs. Conflicting Learning, Evolution and Argumentation
• Semi-equilibrium models for paracoherent answer set programs
• Paracoherent answer set computation

This page was built for publication: Approved Models for Normal Logic Programs

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