5 found
Sort by:
  1. Martin Caminada (2011). A Labelling Approach for Ideal and Stage Semantics. 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 (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Martin Caminada & Bart Verheij (2010). On the Existence of Semi-Stable Extensions. Argumentation 3:4.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Martin W. A. Caminada & Dov M. Gabbay (2009). A Logical Account of Formal Argumentation. 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.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Yining Wu, Martin Caminada & Dov M. Gabbay (2009). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93 (2/3):383 - 403.
    In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation