Complete extensions in argumentation coincide with 3-valued stable models in logic programming

DOI10.1007/s11225-009-9210-5zbMath1189.68127WikidataQ62044301 ScholiaQ62044301MaRDI QIDQ2269506

Martin Caminada, Yining Wu, Dov M. Gabbay

Publication date: 17 March 2010

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-009-9210-5

zbMATH Keywords

logic programming; abstract argumentation; complete extensions; 3-valued stable models

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68N17: Logic programming

Related Items

Range-based argumentation semantics as two-valued models, Abduction in argumentation frameworks, Paracoherent Answer Set Semantics meets Argumentation Frameworks, On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs, On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach, A General Framework for Stable Roommates Problems using Answer Set Programming, Approximating operators and semantics for abstract dialectical frameworks, Theory of semi-instantiation in abstract argumentation, Complexity of abstract argumentation under a claim-centric view, Semantic-based construction of arguments: an answer set programming approach, Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks, On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation, Fibring argumentation frames, A logical account of formal argumentation, Annotation theories over finite graphs, Design and results of the second international competition on computational models of argumentation, On the equivalence between logic programming semantics and argumentation semantics, A QBF-based formalization of abstract argumentation semantics

Cites Work

• Unnamed Item
• On the evaluation of argumentation formalisms
• Computing ideal sceptical argumentation
• 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
• Logical modes of attack in argumentation networks
• Argument-based extended logic programming with defeasible priorities
• An Algorithm for Computing Semi-stable Semantics
• On the Issue of Reinstatement in Argumentation
• Robust semantics for argumentation frameworks