Computational complexity of flat and generic Assumption-Based Argumentation, with and without probabilities.
Kristijonas CyrasQuentin HeinrichFrancesca ToniPublished in: Artif. Intell. (2021)
Keyphrases
- computational complexity
- probability distribution
- np hard
- argumentation systems
- np complete
- special case
- probability theory
- storage requirements
- belief networks
- memory requirements
- decision problems
- rate distortion
- argumentation semantics
- argumentation frameworks
- evidential reasoning
- case study
- argumentation theory
- application specific
- low complexity
- computational efficiency
- computationally efficient
- worst case
- computational cost
- high level