Year:

  1.  7
    A Top-Level Model of Case-Based Argumentation for Explanation: Formalisation and Experiments.Henry Prakken & Rosa Ratsma - 2022 - Argument and Computation 13 (2):159-194.
    This paper proposes a formal top-level model of explaining the outputs of machine-learning-based decision-making applications and evaluates it experimentally with three data sets. The model draws on AI & law research on argumentation with cases, which models how lawyers draw analogies to past cases and discuss their relevant similarities and differences in terms of relevant factors and dimensions in the problem domain. A case-based approach is natural since the input data of machine-learning applications can be seen as cases. While the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  4
    Cross-Issue Correlation Based Opinion Prediction in Cyber Argumentation.Md Mahfuzer Rahman, Xiaoqing “Frank” Liu, Joseph W. Sirrianni & Douglas Adams - 2022 - Argument and Computation 13 (2):209-247.
    One of the challenging problems in large scale cyber-argumentation platforms is that users often engage and focus only on a few issues and leave other issues under-discussed and under-acknowledged. This kind of non-uniform participation obstructs the argumentation analysis models to retrieve collective intelligence from the underlying discussion. To resolve this problem, we developed an innovative opinion prediction model for a multi-issue cyber-argumentation environment. Our model predicts users’ opinions on the non-participated issues from similar users’ opinions on related issues using intelligent (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  1
    Infinite Arguments and Semantics of Dialectical Proof Procedures.Phan Minh Thang, Phan Minh Dung & Jiraporn Pooksook - 2022 - Argument and Computation 13 (2):121-157.
    We study the semantics of dialectical proof procedures. As dialectical proof procedures are in general sound but not complete wrt admissibility semantics, a natural question here is whether we could give a more precise semantical characterization of what they compute. Based on a new notion of infinite arguments representing loops, we introduce a stricter notion of admissibility, referred to as strict admissibility, and show that dialectical proof procedures are in general sound and complete wrt strict admissibility.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  2
    Representing Pure Nash Equilibria in Argumentation.Bruno Yun, Srdjan Vesic & Nir Oren - 2022 - Argument and Computation 13 (2):195-208.
    In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil’s Extended Argumentation Frameworks. We demonstrate its correctness, showprove several theoretical properties it satisfies, and outline how it can be used to explain why certain strategies are Nash equilibria to a non-expert human user.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  1
    Towards an Inclusive, Responsible and Sustainable Open Access Model.Pietro Baroni & Bart Verheij - 2022 - Argument and Computation 13 (1):1-2.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  5
    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  
  7.  39
    A Logic of Defeasible Argumentation: Constructing Arguments in Justification Logic.Stipe Pandžić - 2022 - Argument and Computation 13 (1):3-47.
    In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a logic of structured defeasible arguments using the language of justification logic. In this logic, we introduce defeasible justification assertions of the type t : F that read as “t is a defeasible reason that justifies F”. Such formulas are then interpreted as arguments and their acceptance semantics is given (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  4
    Deductive and Abductive Argumentation Based on Information Graphs.Remi Wieten, Floris Bex, Henry Prakken & Silja Renooij - 2022 - Argument and Computation 13 (1):49-91.
    In this paper, we propose an argumentation formalism that allows for both deductive and abductive argumentation, where ‘deduction’ is used as an umbrella term for both defeasible and strict ‘forward’ inference. Our formalism is based on an extended version of our previously proposed information graph formalism, which provides a precise account of the interplay between deductive and abductive inference and causal and evidential information. In the current version, we consider additional types of information such as abstractions which allow domain experts (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
 Previous issues
  
Next issues