On Deciding Admissibility in Abstract Argumentation Frameworks

被引：0

作者：

Nofal, Samer ^{[1
]}

Atkinson, Katie ^{[2
]}

Dunne, Paul E. ^{[2
]}

机构：

[1] German Jordanian Univ, Dept Comp Sci, Amman, Jordan

[2] Univ Liverpool, Dept Comp Sci, Liverpool, Merseyside, England

来源：

KEOD: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT - VOL 2: KEOD | 2019年

关键词：

Argument-based Knowledge Base; Argument-based Reasoning; Computational Argumentation; Algorithms; DECISION-PROBLEMS; ALGORITHMS; SYSTEMS; INCONSISTENCY;

D O I：

10.5220/0008064300670075

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In the context of abstract argumentation frameworks, the admissibility problem is about deciding whether a given argument (i.e. piece of knowledge) is admissible in a conflicting knowledge base. In this paper we present an enhanced backtracking-based algorithm for solving the admissibility problem. The algorithm performs successfully when applied to a wide range of benchmark abstract argumentation frameworks and when compared to the state-of-the-art algorithm.

引用

页码：67 / 75

页数：9

共 50 条

[41] Quantitative Reasoning over Incomplete Abstract Argumentation Frameworks
Fazzinga, Bettina
Flesca, Sergio
Furfaro, Filippo
Monterosso, Giuseppina
PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 3360 - 3368
[42] Learning Argument Acceptability from Abstract Argumentation Frameworks
Kido, Hiroyuki
NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE, 2017, 10091 : 348 - 362
[43] 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
[44] Rationalisation of profiles of abstract argumentation frameworks: Characterisation and complexity
2017, AI Access Foundation (60):
[45] Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity
Airiau, Stephane
Bonzon, Elise
Endriss, Ulle
Maudet, Nicolas
Rossit, Julien
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 60 : 149 - 177
[46] Probabilistic abstract argumentation frameworks, a possible world view
Mantadelis, Theofrastos
Bistarelli, Stefano
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 119 : 204 - 219
[47] On Supported Inference and Extension Selection in Abstract Argumentation Frameworks
Konieczny, Sebastien
Marquis, Pierre
Vesic, Srdjan
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2015, 2015, 9161 : 49 - 59
[48] Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
Alfano, Gianvincenzo
Calautti, Marco
Greco, Sergio
Parisi, Francesco
Trubitsyna, Irina
ARTIFICIAL INTELLIGENCE, 2023, 323
[49] On efficiently estimating the probability of extensions in abstract argumentation frameworks
Fazzinga, Bettina
Flesca, Sergio
Parisi, Francesco
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 69 : 106 - 132
[50] AGM Meets Abstract Argumentation: Contraction for Dung Frameworks
Baumann, Ringo
Linker, Felix
LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 41 - 57

← 1 2 3 4 5 →