Year:

  1.  5
    A Parametrized Ranking-Based Semantics Compatible with Persuasion Principles.Elise Bonzon, Jérôme Delobelle, Sébastien Konieczny & Nicolas Maudet - 2021 - Argument and Computation 12 (1):49-85.
    In this work, we question the ability of existing ranking-based semantics to capture persuasion settings, emphasising in particular the phenomena of procatalepsis and of fading. Some widely accepted principles of ranking-based semantics are incompatible with a faithful treatment of these phenomena, which means that no existing ranking-based semantics can capture these two principles together. This motivates us to introduce a new parametrized ranking-based semantics based on the notion of propagation which extends the existing propagation semantics 139–150) by adding an additional (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  5
    An Informant-Based Approach to Argument Strength in Defeasible Logic Programming.Andrea Cohen, Sebastian Gottifredi, Luciano H. Tamargo, Alejandro J. García & Guillermo R. Simari - 2021 - Argument and Computation 12 (1):115-147.
    This work formalizes an informant-based structured argumentation approach in a multi-agent setting, where the knowledge base of an agent may include information provided by other agents, and each piece of knowledge comes attached with its informant. In that way, arguments are associated with the set of informants corresponding to the information they are built upon. Our approach proposes an informant-based notion of argument strength, where the strength of an argument is determined by the credibility of its informant agents. Moreover, we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  5
    Rationality and Maximal Consistent Sets for a Fragment of ASPIC + Without Undercut.Jesse Heyninck & Christian Straßer - 2021 - Argument and Computation 12 (1):3-47.
    Structured argumentation formalisms, such as ASPIC +, offer a formal model of defeasible reasoning. Usually such formalisms are highly parametrized and modular in order to provide a unifying framework in which different forms of reasoning can be expressed. This generality comes at the price that, in their most general form, formalisms such as ASPIC + do not satisfy important rationality postulates, such as non-interference. Similarly, links to other forms of knowledge representation, such as reasoning with maximal consistent sets of rules, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  8
    Preface for the Special Issue on Argument Strength.Gabriella Pigozzi & Srdjan Vesic - 2021 - Argument and Computation 12 (1):1-2.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  8
    United We Stand: Accruals in Strength-Based Argumentation.Julien Rossit, Jean-Guy Mailly, Yannis Dimopoulos & Pavlos Moraitis - 2021 - Argument and Computation 12 (1):87-113.
    Argumentation has been an important topic in knowledge representation, reasoning and multi-agent systems during the last twenty years. In this paper, we propose a new abstract framework where arguments are associated with a strength, namely a quantitative information which is used to determine whether an attack between arguments succeeds or not. Our Strength-based Argumentation Framework combines ideas of Preference-based and Weighted Argumentation Frameworks in an original way, which permits to define acceptability semantics sensitive to the existence of accruals between arguments. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
 Previous issues
  
Next issues