Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Carneades / rank | |||
Normal rank | |||
Revision as of 02:54, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory |
scientific article |
Statements
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (English)
0 references
18 December 2015
0 references
abstract dialectical frameworks
0 references
computational complexity
0 references
approximation fixpoint theory
0 references
