| Computing Grounded Extensions Of Abstract Argumentation Frameworks. | 0 | 0.34 | 2021 |
| Delegating Decisions in Strategic Settings | 0 | 0.34 | 2020 |
| Characterizing Strongly Admissible Sets | 0 | 0.34 | 2020 |
| On checking skeptical and ideal admissibility in abstract argumentation frameworks | 0 | 0.34 | 2019 |
| Strong Admissibility Revisited: Theory And Applications | 0 | 0.34 | 2019 |
| Computation Counts - An Introduction to Analytic Concepts in Computer Science. | 0 | 0.34 | 2019 |
| On Deciding Admissibility In Abstract Argumentation Frameworks | 0 | 0.34 | 2019 |
| Computational Problems in Formal Argumentation and their Complexity. | 1 | 0.35 | 2017 |
| Spectral Techniques in Argumentation Framework Analysis. | 1 | 0.38 | 2016 |
| A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation. | 0 | 0.34 | 2016 |
| I Heard You the First Time: Debate in Cacophonous Surroundings. | 0 | 0.34 | 2016 |
| Looking-ahead in backtracking algorithms for abstract argumentation. | 5 | 0.43 | 2016 |
| Forbidden Sets in Argumentation Semantics. | 0 | 0.34 | 2016 |
| Senses Of 'Argument' In Instantiated Argumentation Frameworks | 3 | 0.46 | 2015 |
| Properties of Random VAFs and Implications for Efficient Algorithms. | 0 | 0.34 | 2014 |
| Characteristics of Multiple Viewpoints in Abstract Argumentation. | 26 | 1.36 | 2014 |
| Multimodal distributional semantics | 16 | 0.69 | 2014 |
| Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments | 6 | 0.43 | 2014 |
| Complexity Properties of Critical Sets of Arguments. | 4 | 0.40 | 2014 |
| Algorithms for decision problems in argument systems under preferred semantics | 36 | 1.10 | 2014 |
| On The Instantiation Of Knowledge Bases In Abstract Argumentation Frameworks | 15 | 0.63 | 2013 |
| Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach. | 4 | 0.40 | 2013 |
| Automata for infinite argumentation structures | 8 | 0.55 | 2013 |
| Parametric properties of ideal semantics. | 16 | 0.58 | 2013 |
| Towards tractable Boolean games | 0 | 0.34 | 2012 |
| Towards Experimental Algorithms for Abstract Argumentation. | 2 | 0.39 | 2012 |
| Semi-Stable Semantics | 90 | 3.73 | 2012 |
| Uniform Argumentation Frameworks. | 0 | 0.34 | 2012 |
| Towards tractable Boolean games | 7 | 0.69 | 2012 |
| On Preferred Extension Enumeration in Abstract Argumentation. | 4 | 0.46 | 2012 |
| Argument Aggregation: Basic Axioms and Complexity Results. | 0 | 0.34 | 2012 |
| On Constructing Minimal Formulae | 2 | 0.38 | 2011 |
| Weighted argument systems: Basic definitions, algorithms, and complexity results | 105 | 3.12 | 2011 |
| Computing with infinite argumentation frameworks: the case of AFRAs | 3 | 0.41 | 2011 |
| Extremal behaviour in multiagent contract negotiation | 26 | 2.07 | 2011 |
| Exploring the Role of Emotions in Rational Decision Making | 9 | 0.57 | 2010 |
| Solving coalitional resource games | 11 | 0.82 | 2010 |
| Tractability in Value-based Argumentation | 8 | 0.49 | 2010 |
| Computation in Extended Argumentation Frameworks | 3 | 0.46 | 2010 |
| Computation with varied-strength attacks in abstract argumentation frameworks | 4 | 0.45 | 2010 |
| Computational properties of resolution-based grounded semantics | 5 | 0.51 | 2009 |
| Instantiating Knowledge Bases in Abstract Argumentation Frameworks. | 6 | 0.58 | 2009 |
| Inconsistency tolerance in weighted argument systems | 48 | 1.92 | 2009 |
| Emotions in rational decision making | 3 | 0.46 | 2009 |
| Asking the Right Question: Forcing Commitment in Examination Dialogues | 1 | 0.41 | 2008 |
| The complexity of deciding reachability properties of distributed negotiation schemes | 6 | 0.55 | 2008 |
| Cooperative Boolean games | 38 | 1.83 | 2008 |
| The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks | 8 | 0.60 | 2008 |
| Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks | 20 | 0.86 | 2008 |
| Argumentation in artificial intelligence | 167 | 5.14 | 2007 |
