Paraconsistent Labeling Semantics for Abstract Argumentation

被引：0
|
作者：
Lin, Yuanlei [1 ]
机构：
[1] Nanchang Univ, Dept Philosophy, Xuefu Rd 999, Nanchang 330031, Peoples R China
来源：
MATHEMATICS | 2024年 / 12卷 / 05期
关键词：
abstract argumentation; paraconsistent labeling semantics; modal logic;
D O I：
10.3390/math12050688
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Dung's abstract argumentation framework is a popular formalism in formal argumentation. The present work develops paraconsistent labeling semantics for abstract argumentation such that the incomplete and inconsistent information can be expressed, and it introduces a Hilbert-style axiomatic system which is proven to be sound and complete. Additionally, we make a comparison between the logic developed in the present work and some relevant theories of abstract argumentation.
引用
收藏
页数：13
相关论文
共 50 条
  • [21] Behavioral Experiments for Assessing the Abstract Argumentation Semantics of Reinstatement
    Rahwan, Iyad
    Madakkatel, Mohammed I.
    Bonnefon, Jean-Francois
    Awan, Ruqiyabi N.
    Abdallah, Sherief
    COGNITIVE SCIENCE, 2010, 34 (08) : 1483 - 1502
  • [22] On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (05) : 703 - 718
  • [23] AGNN: A Deep Learning Architecture for Abstract Argumentation Semantics
    Craandijk, Dennis
    Bex, Floris
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 457 - 458
  • [24] Proximity semantics for topic-based abstract argumentation
    Budan, Maximiliano C. D.
    Laura Cobo, Maria
    Martinez, Diego C.
    Simari, Guillermo R.
    INFORMATION SCIENCES, 2020, 508 (135-153) : 135 - 153
  • [25] Paraconsistent argumentation schemes
    Dunin-Keplicz, Barbara
    Strachocka, Alina
    WEB INTELLIGENCE, 2016, 14 (01) : 43 - 65
  • [26] The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
    Dunne, Paul E.
    COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008, 2008, 172 : 147 - 158
  • [27] Extending Modular Semantics for Bipolar Weighted Argumentation (Extended Abstract)
    Potyka, Nico
    ADVANCES IN ARTIFICIAL INTELLIGENCE, KI 2019, 2019, 11793 : 273 - 276
  • [28] A general approach to extension-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    ARTIFICIAL INTELLIGENCE, 2023, 315
  • [29] On the Complexity of Determining Defeat Relations Consistent with Abstract Argumentation Semantics
    Mumford, Jack
    Sassoon, Isabel
    Black, Elizabeth
    Parsons, Simon
    COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 260 - 271
  • [30] Incremental Computation of Grounded Semantics for Dynamic Abstract Argumentation Frameworks
    Greco, Sergio
    Parisi, Francesco
    CONFLICT RESOLUTION IN DECISION MAKING, COREDEMA 2016, 2017, 10238 : 66 - 81
12345