Switch to: Citations

Add references

You must login to add references.
  1. Temporal, numerical and meta-level dynamics in argumentation networks.H. Barringer, D. M. Gabbay & J. Woods - 2012 - Argument and Computation 3 (2-3):143 - 202.
    This paper studies general numerical networks with support and attack. Our starting point is argumentation networks with the Caminada labelling of three values 1=in, 0=out and ½=undecided. This is generalised to arbitrary values in [01], which enables us to compare with other numerical networks such as predator?prey ecological networks, flow networks, logical modal networks and more. This new point of view allows us to see the place of argumentation networks in the overall landscape of networks and import and export ideas (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A labelling approach for ideal and stage semantics.Martin Caminada - 2011 - Argument and Computation 2 (1):1 - 21.
    In this document, we describe the concepts of ideal semantics and stage semantics for abstract argumentation in terms of argument labellings. The difference between the traditional extensions approach and the labelling approach is that where the former only identifies the sets of accepted arguments, the latter also identifies the rejected arguments as well as the arguments that are neither accepted nor rejected. So far, the labellings approach has been successfully applied to complete, grounded, preferred, stable and semi-stable semantics, as well (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)A Logical Account of Formal Argumentation.Martin W. A. Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):109-145.
    In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.
    Download  
     
    Export citation  
     
    Bookmark   56 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  
  • Fibring Logics.Dov M. Gabbay - 2000 - Studia Logica 66 (3):440-443.
    Download  
     
    Export citation  
     
    Bookmark   21 citations