Name
Abstract | ||
|---|---|---|
In a recent work we have proposed a comprehensive set of evaluation criteria for argumentation semantics and we have shown that none of a set of semantics including both traditional and recent proposals is able to meet all criteria. This naturally raises the question whether such criteria are actually satisfiable altogether: this paper provides a positive answer to this question by introducing a new family of argumentation semantics, called resolution-based and showing that all the desirable criteria are met by the resolution-based version of grounded semantics. |
Year | Venue | Keywords |
|---|---|---|
2008 | Computational Models of Argument | resolution-based argumentation semantics,argumentation semantics,positive answer,new family,desirable criterion,comprehensive set,evaluation criterion,recent work,resolution-based version,recent proposal |
Field | DocType | Volume |
Operational semantics,Computer science,Knowledge management,Natural language processing,Artificial intelligence,Argumentation semantics,Well-founded semantics,Semantics,Semantics of logic | Conference | 172 |
ISSN | Citations | PageRank |
0922-6389 | 18 | 1.26 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pietro Baroni | 1 | 722 | 50.00 |
| Massimiliano Giacomin | 2 | 785 | 54.15 |