Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility (Q5094077)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7566014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility |
scientific article; zbMATH DE number 7566014 |
Statements
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility (English)
0 references
2 August 2022
0 references
knowledge representation
0 references
computational complexity
0 references
abstract argumentation frameworks
0 references
0.8053149580955505
0 references
0.8013231158256531
0 references
0.8000979423522949
0 references
0.7916772961616516
0 references
0.7886325716972351
0 references
