Taking into account ``who said what in abstract argumentation: complexity results
From MaRDI portal
Publication:6161469
DOI10.1016/j.artint.2023.103885OpenAlexW4321793649MaRDI QIDQ6161469
Filippo Furfaro, Sergio Flesca, Bettina Fazzinga
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2023.103885
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Verification in incomplete argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Equilibrium states in numerical argumentation networks
- The complexity of optimization problems
- More complicated questions about maxima and minima, and some closures of NP
- Generalizations of Opt P to the polynomial hierarchy
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A socio-cognitive model of trust using argumentation theory
- Complexity of nonemptiness in control argumentation frameworks
- Acceptance in incomplete argumentation frameworks
- Preference-based argumentation: arguments supporting multiple values
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Rich preference-based argumentation frameworks
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- Using argumentation to reason about trust and belief
- On the Gradual Acceptability of Arguments in Bipolar Weighted Argumentation Frameworks with Degrees of Trust
- Fuzzy Argumentation for Trust
- Epistemic Argumentation Framework: Theory and Computation
- Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: Taking into account ``who said what in abstract argumentation: complexity results