Switch to: References

Add citations

You must login to add citations.
  1. The attack as strong negation, part I.D. Gabbay & M. Gabbay - 2015 - Logic Journal of the IGPL 23 (6):881-941.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The attack as intuitionistic negation.D. Gabbay & M. Gabbay - 2016 - Logic Journal of the IGPL 24 (5):807-837.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Equational approach to argumentation networks.D. M. Gabbay - 2012 - Argument and Computation 3 (2-3):87 - 142.
    This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the ?extensions? of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, and much more. The equational approach has its conceptual roots in the nineteenth (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Dung’s Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce–Quine Dagger.Dov M. Gabbay - 2011 - Logica Universalis 5 (2):255-318.
    In this paper we show that some versions of Dung’s abstract argumentation frames are equivalent to classical propositional logic. In fact, Dung’s attack relation is none other than the generalised Peirce–Quine dagger connective of classical logic which can generate the other connectives ${\neg, \wedge, \vee, \to}$ of classical logic. After establishing the above correspondence we offer variations of the Dung argumentation frames in parallel to variations of classical logic, such as resource logics, predicate logic, etc., etc., and create resource argumentation (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence.Bettina Fazzinga, Sergio Flesca & Filippo Furfaro - 2019 - Artificial Intelligence 268 (C):1-29.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Abstract argumentation and explanation applied to scientific debates.Dunja Šešelja & Christian Straßer - 2013 - Synthese 190 (12):2195-2217.
    argumentation has been shown to be a powerful tool within many fields such as artificial intelligence, logic and legal reasoning. In this paper we enhance Dung’s well-known abstract argumentation framework with explanatory capabilities. We show that an explanatory argumentation framework (EAF) obtained in this way is a useful tool for the modeling of scientific debates. On the one hand, EAFs allow for the representation of explanatory and justificatory arguments constituting rivaling scientific views. On the other hand, different procedures for selecting (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Representing the semantics of abstract dialectical frameworks based on arguments and attacks.Phan Minh Dung & Phan Minh Thang - 2018 - Argument and Computation 9 (3):249-267.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Parametric properties of ideal semantics.Paul E. Dunne, Wolfgang Dvořák & Stefan Woltran - 2013 - Artificial Intelligence 202 (C):1-28.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • RAFDivider: a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks.Sylvie Doutre & Marie-Christine Lagasquie-Schiex - 2023 - Journal of Applied Non-Classical Logics 33 (3-4):244-297.
    1. Argumentation, by considering arguments and their interactions, is a way of reasoning that has proven successful in many contexts, for instance, in multi-agent applications (Carrera & Iglesias,...
    Download  
     
    Export citation  
     
    Bookmark  
  • Preferences in AI: An overview.Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci & Henri Prade - 2011 - Artificial Intelligence 175 (7-8):1037-1052.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Schemes of Inference, Conflict, and Preference in a Computational Model of Argument.Floris Bex & Chris Reed - 2011 - Studies in Logic, Grammar and Rhetoric 23 (36).
    Download  
     
    Export citation  
     
    Bookmark   5 citations