Name
Abstract | ||
|---|---|---|
We refine implemented backtracking algorithms for a number of problems related to Dung's argumentation frameworks. Under admissible, preferred, complete, stable, semi stable, and ideal semantics we add enhancements, what are so-called global looking-ahead pruning strategies, to the-state-of-the-art implementations of two problems. First, we tackle the extension enumeration problem: constructing some/all set(s) of acceptable arguments of a given argumentation framework. Second, we address the acceptance decision problem: deciding whether an argument is in some/all set(s) of accepted arguments of a given argumentation framework. The experiments that we report show that the speedup gain of the new enhancements is quite significant. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ijar.2016.07.013 | Int. J. Approx. Reasoning |
Keywords | Field | DocType |
Algorithms,Argumentation semantics,Argument-based reasoning | Argumentation framework,Computer science,Argumentation theory,Implementation,Theoretical computer science,Artificial intelligence,Backtracking,Speedup,Decision problem,Enumeration,Algorithm,Semantics,Machine learning | Journal |
Volume | Issue | ISSN |
78 | C | 0888-613X |
Citations | PageRank | References |
5 | 0.43 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samer Nofal | 1 | 54 | 4.85 |
| Katie Atkinson | 2 | 849 | 77.06 |
| Paul E. Dunne | 3 | 1700 | 112.42 |