Heureka: A General Heuristic Backtracking Solver for Abstract Argumentation

被引：7

作者：

Geilen, Nils ^{[1
]}

Thimm, Matthias ^{[1
]}

机构：

[1] Univ Koblenz Landau, Inst Web Sci & Technol, Koblenz, Germany

来源：

THEORY AND APPLICATIONS OF FORMAL ARGUMENTATION, TAFA 2017 | 2018年 / 10757卷

关键词：

ALGORITHMS; SEMANTICS;

D O I：

10.1007/978-3-319-75553-3_10

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The heureka solver is a general-purpose solver for various problems in abstract argumentation frameworks pertaining to complete, grounded, preferred and stable semantics. It is based on a backtracking approach and makes use of various heuristics to optimize the search.

引用

页码：143 / 149

页数：7

共 5 条

[1] SCC-recursiveness: a general schema for argumentation semantics
Baroni, P
Giacomin, M
Guida, G
[J]. ARTIFICIAL INTELLIGENCE, 2005, 168 (1-2) : 162 - 210
[2] Corea C., 2016, P 1 INT WORKSH SYST P 1 INT WORKSH SYST, P10
[3] ON THE ACCEPTABILITY OF ARGUMENTS AND ITS FUNDAMENTAL ROLE IN NONMONOTONIC REASONING, LOGIC PROGRAMMING AND N-PERSON GAMES
DUNG, PM
[J]. ARTIFICIAL INTELLIGENCE, 1995, 77 (02) : 321 - 357
[4] Looking-ahead in backtracking algorithms for abstract argumentation
Nofal, Samer
Atkinson, Katie
Dunne, Paul E.
[J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 78 : 265 - 282
[5] Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
Nofal, Samer
Atkinson, Katie
Dunne, Paul E.
[J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 49 : 635 - 668

← 1 →