10 found
Order:
Disambiguations
Martin Caminada [9]Martin W. A. Caminada [2]
  1.  15
    On the evaluation of argumentation formalisms.Martin Caminada & Leila Amgoud - 2007 - Artificial Intelligence 171 (5-6):286-310.
  2.  49
    A Logical Account of Formal Argumentation.Yining Wu, Martin Caminada & Dov M. Gabbay - 2009 - 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 (9 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  3.  16
    Strong admissibility revisited: Theory and applications.Martin Caminada & Paul Dunne - forthcoming - Argument and Computation:1-24.
  4.  52
    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  
  5.  26
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  6.  34
    On the existence of semi-stable extensions.Martin Caminada & Bart Verheij - unknown
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  12
    Tractable algorithms for strong admissibility.Martin Caminada & Sri Harikrishnan - forthcoming - Argument and Computation:1-31.
    Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded extension. As such, strongly admissible sets and labellings can be used as an explanation of membership of the grounded extension, as is for instance done in some of the proof procedures for grounded semantics. In the current paper, we present two polynomial algorithms for constructing relatively small (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  10
    Attack semantics and collective attacks revisited.Martin Caminada, Matthias König, Anna Rapberger & Markus Ulbricht - forthcoming - Argument and Computation:1-77.
    In the current paper we re-examine the concepts of attack semantics and collective attacks in abstract argumentation, and examine how these concepts interact with each other. For this, we systematically map the space of possibilities. Starting with standard argumentation frameworks (which consist of a directed graph with nodes and arrows) we briefly state both node semantics and arrow semantics (the latter a.k.a. attack semantics) in both their extensions-based form and labellings-based form. We then proceed with SETAFs (which consist of a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  80
    Comparing logic programming and formal argumentation; the case of ideal and eager semantics.Martin Caminada, Sri Harikrishnan & Samy Sá - 2022 - Argument and Computation 13 (1):93-120.
    The connection between logic programming and formal argumentation has been studied starting from the landmark 1995 paper of Dung. Subsequent work has identified a standard translation from logic programs to argumentation frameworks, under which pairwise correspondences hold between various logic programming semantics and various formal argumentation semantics. This includes the correspondence between 3-valued stable and complete semantics, between well-founded and grounded semantics and between 2-valued stable and stable semantics. In the current paper, we show that the existing translation is able (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  32
    A formal account of Socratic-style argumentation.Martin W. A. Caminada - 2008 - Journal of Applied Logic 6 (1):109-132.