Pages that link to "Item:Q2957945"
From MaRDI portal
The following pages link to On the acceptance of loops in argumentation frameworks (Q2957945):
Displaying 10 items.
- Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack (Q846524) (← links)
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks (Q901144) (← links)
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation (Q1711893) (← links)
- Dilemmas and paradoxes: cycles in argumentation frameworks (Q2957942) (← links)
- The handling of loops in argumentation networks (Q2957943) (← links)
- Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria (Q2957946) (← links)
- The role of self-attacking arguments in characterizations of equivalence notions (Q2957948) (← links)
- Robust semantics for argumentation frameworks (Q4242588) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation (Q5172620) (← links)