On the acceptance of loops in argumentation frameworks

DOI10.1093/LOGCOM/EXU009MaRDI QIDQ2957945zbMATH OpenOpenAlexFDO

Authors Ofer Arieli

Publication date 31 January 2017

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0c16d62e97dd6c6b5fe69eab558eb7bb6c5e9066

zbMATH Keywords

4-valued labelingabstract argumentationconflict-tolerant semanticsparaconsistent extensions

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• The handling of loops in argumentation networks
• Acceptance in incomplete argumentation frameworks
• On the input/output behavior of argumentation frameworks
• Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
• On computing the set of acceptable arguments in abstract argumentation
• Revisiting Abstract Argumentation Frameworks
• Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
• A logic of argumentation for specification and verification of abstract argumentation frameworks
• On the semantics of abstract argumentation frameworks: a logic programming approach
• A dialectical proof theory for universal acceptance in coherent logic-based argumentation frameworks

Cited in

(14)

• On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
• Conflict-tolerant semantics for argumentation frameworks
• Dilemmas and paradoxes: cycles in argumentation frameworks
• The handling of loops in argumentation networks
• Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
• The role of self-attacking arguments in characterizations of equivalence notions
• Robust semantics for argumentation frameworks
• A brief introduction to the Shkop approach to conflict resolution in formal argumentation
• Paracoherent answer set semantics meets argumentation frameworks
• I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
• Introducing abstract argumentation with many lives
• Abstract argumentation frameworks with strong and weak constraints
• Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks

This page was built for publication: On the acceptance of loops in argumentation frameworks

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