An abstract argumentation and logic programming comparison based on 5-valued labellings

DOI10.1007/978-3-030-86772-0_12OpenAlexW3201601375MaRDI QIDQ2146012

Samy Sá, João Alcântara

Publication date: 15 June 2022

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

zbMATH Keywords

logic programmingabstract argumentationargument labellings

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

Static and dynamic orderings on Dungean argumentation frameworks -- an overview

Cites Work

• Unnamed Item
• Algorithms for decision problems in argument systems under preferred semantics
• On the partial semantics for disjunctive deductive databases
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• On the equivalence between logic programming semantics and argumentation semantics
• Argumentation and Answer Set Programming
• Preferred extensions as stable models
• On the Issue of Reinstatement in Argumentation
• Robust semantics for argumentation frameworks
• An argumentation-theoretic foundation for logic programming
• I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation

This page was built for publication: An abstract argumentation and logic programming comparison based on 5-valued labellings