Reading Club on Oct 14th (领读人:陈东恒)
The paper discussed in this reading club is Complexity of Abstract Argumentation.
The paper discussed in this reading club is Complexity of Abstract Argumentation.
The paper discussed in this reading club is: Computers and Intractability A Guide to the Theory of NP-Completeness.
The paper discussed in this reading club is: Epistemic Graphs for Representing and Reasoning with Positive and Negative Influences of Arguments.
The paper discussed in this reading club is: Toward incremental computation of argumentation semantics: A decomposition-based approach.
The paper discussed in this reading club is: An appreciation of John Pollock’s work on the computational study of argument.
The paper discussed in this reading club is Bipolarity in argumentation graphs: Towards a better understanding.
The paper discussed in this reading club is On Cycles, Attackers and Supporters – A Contribution to The Investigation of Dynamics in Abstract Argumentation.
The paper discussed in this reading club is Maximizing goals achievement through abstract argumentation frameworks-An optimal approach.
The paper discussed in this reading club is Automatic evaluation of design alternatives with quantitative argumentation.