Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.artint.2015.05.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1503237869 / rank | |||
Normal rank | |||
Revision as of 00:02, 20 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
