Name
Abstract | ||
|---|---|---|
In the context of Dung's theory of abstract argumentation frameworks, the recently introduced resolution-based grounded semantics features the unique property of fully complying with a set of general requirements, only partially satisfied by previous literature proposals. This paper contributes to the investigation of resolution-based grounded semantics by analyzing its computational properties with reference to a standard set of decision problems for abstract argumentation semantics: (a) checking the property of being an extension for a set of arguments; (b) checking agreement with traditional grounded semantics; (c) checking the existence of a non-empty extension; (d) checking credulous acceptance of an argument; (e) checking skeptical acceptance of an argument. It is shown that problems (a)-(c) admit polynomial time decision processes, while (d) is NP-complete and (e) coNP-complete. |
Year | Venue | Keywords |
|---|---|---|
2009 | IJCAI | abstract argumentation framework,abstract argumentation semantics,decision problem,credulous acceptance,non-empty extension,unique property,skeptical acceptance,standard set,polynomial time decision process,computational property,satisfiability,polynomial time |
Field | DocType | Citations |
Discrete mathematics,Decision problem,Computer science,Argumentation theory,Theoretical computer science,Skepticism,Decision process,Time complexity,Argumentation semantics,Semantics | Conference | 5 |
PageRank | References | Authors |
0.51 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pietro Baroni | 1 | 722 | 50.00 |
| Paul E. Dunne | 2 | 1700 | 112.42 |
| Massimiliano Giacomin | 3 | 785 | 54.15 |