Switch to: References

Add citations

You must login to add citations.
  1. Handbook of Argumentation Theory.Frans H. van Eemeren, Bart Garssen, Erik C. W. Krabbe, A. Francisca Snoeck Henkemans, Bart Verheij & Jean H. M. Wagemans - 2014 - Dordrecht, Netherland: Springer.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Initial sets in abstract argumentation frameworks.Yuming Xu & Claudette Cayrol - 2018 - Journal of Applied Non-Classical Logics 28 (2-3):260-279.
    Dung’s abstract argumentation provides us with a general framework to deal with argumentation, non-monotonic reasoning and logic programming. For the extension-based semantics, one of the basic principles is I-maximality which is in particular related with the notion of skeptical justification. Another one is directionality which can be employed for the study of dynamics of argumentation. In this paper, we introduce two new extension-based semantics into Dung’s abstract argumentation, called grounded-like semantics and initial semantics which satisfy the I-maximality and directionality principles. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Structural constraints for dynamic operators in abstract argumentation.Johannes P. Wallner - 2020 - Argument and Computation 11 (1-2):151-190.
  • Algorithms for decision problems in argument systems under preferred semantics.Samer Nofal, Katie Atkinson & Paul E. Dunne - 2014 - Artificial Intelligence 207 (C):23-51.
  • Dynamics of argumentation systems: A division-based method.Beishui Liao, Li Jin & Robert C. Koons - 2011 - Artificial Intelligence 175 (11):1790-1814.
  • Algorithms and complexity results for persuasive argumentation.Eun Jung Kim, Sebastian Ordyniak & Stefan Szeider - 2011 - Artificial Intelligence 175 (9-10):1722-1736.
  • New width parameters for SAT and #SAT.Robert Ganian & Stefan Szeider - 2021 - Artificial Intelligence 295 (C):103460.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Backdoors to tractable answer set programming.Johannes Klaus Fichte & Stefan Szeider - 2015 - Artificial Intelligence 220 (C):64-103.
  • The complexity landscape of claim-augmented argumentation frameworks.Wolfgang Dvořák, Alexander Greßler, Anna Rapberger & Stefan Woltran - 2023 - Artificial Intelligence 317 (C):103873.
  • Towards fixed-parameter tractable algorithms for abstract argumentation.Wolfgang Dvořák, Reinhard Pichler & Stefan Woltran - 2012 - Artificial Intelligence 186 (C):1-37.
  • Complexity-sensitive decision procedures for abstract argumentation.Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner & Stefan Woltran - 2014 - Artificial Intelligence 206 (C):53-78.
  • Complexity of abstract argumentation under a claim-centric view.Wolfgang Dvořák & Stefan Woltran - 2020 - Artificial Intelligence 285 (C):103290.
  • Augmenting tractable fragments of abstract argumentation.Wolfgang Dvořák, Sebastian Ordyniak & Stefan Szeider - 2012 - Artificial Intelligence 186 (C):157-173.
  • Weighted argument systems: Basic definitions, algorithms, and complexity results.Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons & Michael Wooldridge - 2011 - Artificial Intelligence 175 (2):457-486.
  • The computational complexity of ideal semantics.Paul E. Dunne - 2009 - Artificial Intelligence 173 (18):1559-1591.
  • Parametric properties of ideal semantics.Paul E. Dunne, Wolfgang Dvořák & Stefan Woltran - 2013 - Artificial Intelligence 202 (C):1-28.
  • Investigating subclasses of abstract dialectical frameworks.Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler & Stefan Woltran - 2020 - Argument and Computation 11 (1-2):191-219.
  • Methods for solving reasoning problems in abstract argumentation – A survey.Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner & Stefan Woltran - 2015 - Artificial Intelligence 220 (C):28-63.
  • Why argue? Towards a cost–benefit analysis of argumentation.Cristiano Castelfranchi & Fabio Paglieri - 2010 - Argument and Computation 1 (1):71-91.
    This article proposes a cost-benefit analysis of argumentation, with the aim of highlighting the strategic considerations that govern the agent's decision to argue or not. In spite of its paramount importance, the topic of argumentative decision-making has not received substantial attention in argumentation theories so far. We offer an explanation for this lack of consideration and propose a tripartite taxonomy and detailed description of the strategic reasons considered by arguers in their decision-making: benefits, costs, and dangers. We insist that the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   27 citations  
  • Meta-Argumentation Modelling I: Methodology and Techniques.Guido Boella, Dov M. Gabbay, Leendert van der Torre & Serena Villata - 2009 - Studia Logica 93 (2-3):297 - 355.
    In this paper, we introduce the methodology and techniques of metaargumentation to model argumentation. The methodology of meta-argumentation instantiates Dung's abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung's basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung's theory of abstract argumentation to itself, by instantiating Dung's abstract arguments with meta-arguments using a technique called flattening. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Meta-Argumentation Modelling I: Methodology and Techniques.Guido Boella, Dov Gabbay, Leendert Torre & Serena Villata - 2009 - Studia Logica 93 (2-3):297-355.
    In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung’s basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung’s theory of abstract argumentation to itself, by instantiating Dung’s abstract arguments with meta-arguments using a technique called flattening. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Audiences in argumentation frameworks.Trevor J. M. Bench-Capon, Sylvie Doutre & Paul E. Dunne - 2007 - Artificial Intelligence 171 (1):42-71.
  • On rejected arguments and implicit conflicts: The hidden power of argumentation semantics.Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Christof Spanring, Hannes Strass & Stefan Woltran - 2016 - Artificial Intelligence 241 (C):244-284.
  • A general notion of equivalence for abstract argumentation.Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler & Stefan Woltran - 2019 - Artificial Intelligence 275 (C):379-410.
  • Acceptance in incomplete argumentation frameworks.Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen & Jörg Rothe - 2021 - Artificial Intelligence 295 (C):103470.
  • On the resolution-based family of abstract argumentation semantics and its grounded instance.P. Baroni, P. E. Dunne & M. Giacomin - 2011 - Artificial Intelligence 175 (3-4):791-813.
  • A QBF-based formalization of abstract argumentation semantics.Ofer Arieli & Martin W. A. Caminada - 2013 - Journal of Applied Logic 11 (2):229-252.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Equivalence in logic-based argumentation.Leila Amgoud, Philippe Besnard & Srdjan Vesic - 2014 - Journal of Applied Non-Classical Logics 24 (3):181-208.
    This paper investigates when two abstract logic-based argumentation systems are equivalent. It defines various equivalence criteria, investigates the links between them, and identifies cases where two systems are equivalent with respect to each of the proposed criteria. In particular, it shows that under some reasonable conditions on the logic underlying an argumentation system, the latter has an equivalent finite subsystem, called core. This core constitutes a threshold under which arguments of the system have not yet attained their final status and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations