Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational properties of argument systems satisfying graph-theoretic constraints |
scientific article; zbMATH DE number 5576694
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational properties of argument systems satisfying graph-theoretic constraints |
scientific article; zbMATH DE number 5576694 |
Statements
Computational properties of argument systems satisfying graph-theoretic constraints (English)
0 references
9 July 2009
0 references
computational properties of argumentation
0 references
argumentation frameworks
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0.8932609
0 references
0.88153946
0 references
0.8801381
0 references
0.8758416
0 references
0.8745267
0 references
