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 条
  • [31] 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
  • [32] A Comparative Study of Ranking-Based Semantics for Abstract Argumentation
    Bonzon, Elise
    Delobelle, Jerome
    Konieczny, Sebastien
    Maudet, Nicolas
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 914 - 920
  • [33] 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
  • [34] Combining Extension-Based Semantics and Ranking-Based Semantics for Abstract Argumentation
    Bonzon, Elise
    Delobelle, Jerome
    Konieczny, Sebastien
    Maudet, Nicolas
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 118 - 127
  • [35] Combining Paraconsistent Logic with Argumentation
    Grooters, Diana
    Prakken, Henry
    COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 301 - 312
  • [36] Reduced meet over labelling-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    INFORMATION PROCESSING LETTERS, 2025, 187
  • [37] Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility
    Dvorak, Wolfgang
    Ulbricht, Markus
    Woltran, Stefan
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2022, 74 : 1403 - 1447
  • [38] Recursion in Abstract Argumentation is Hard — On the Complexity of Semantics Based on Weak Admissibility
    Dvořák W.
    Ulbricht M.
    Woltran S.
    Journal of Artificial Intelligence Research, 2022, 74 : 1403 - 1447
  • [39] Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility
    Dvorak, Wolfgang
    Ulbricht, Markus
    Woltran, Stefan
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 6288 - 6295
  • [40] Argument, I Choose You! Preferences and Ranking Semantics in Abstract Argumentation
    Mailly, Jean-Guy
    Rossit, Julien
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 647 - 651
12345