共 50 条
- [41] The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008, 2008, 172 : 147 - 158
- [43] On Relating Abstract and Structured Probabilistic Argumentation: A Case Study SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2017, 2017, 10369 : 69 - 79
- [45] On the Complexity of Determining Defeat Relations Consistent with Abstract Argumentation Semantics COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 260 - 271
- [46] A Comparative Study of Ranking-Based Semantics for Abstract Argumentation THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 914 - 920
- [47] Incremental Computation of Grounded Semantics for Dynamic Abstract Argumentation Frameworks CONFLICT RESOLUTION IN DECISION MAKING, COREDEMA 2016, 2017, 10238 : 66 - 81
- [48] Combining Extension-Based Semantics and Ranking-Based Semantics for Abstract Argumentation SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 118 - 127
- [49] Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6362 - 6366