Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks

Skiba, Kenneth; Neugebauer, Daniel; Rothe, Jörg

doi:10.1109/mis.2020.3046782

Search citation statements

Order By: Relevance

Paper Sections

Select...

Complexity1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2023

Publication Types

Select...

Article4

Book1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 6 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Non-empty existence. The variants of non-empty existence have been defined in [77,78]: σ -PNE Given I = A, A ? , R, R ?…”

Section: Complexitymentioning

confidence: 99%

Yes, no, maybe, I don’t know: Complexity and application of abstract argumentation with incomplete knowledge

Mailly

2022

AAC

View full text Add to dashboard Cite

argumentation, as originally defined by Dung, is a model that allows the description of certain information about arguments and relationships between them: in an abstract argumentation framework (AF), the agent knows for sure whether a given argument or attack exists. It means that the absence of an attack between two arguments can be interpreted as “we know that the first argument does not attack the second one”. But the question of uncertainty in abstract argumentation has received much attention in the last years. In this paper, we survey approaches that allow to express information like “There may (or may not) be an attack between these arguments”. We describe the main models that incorporate qualitative uncertainty (or ignorance) in abstract argumentation, as well as some applications of these models. We also highlight some open questions that deserve some attention in the future.

show abstract

“…Non-empty existence. The variants of non-empty existence have been defined in [77,78]: σ -PNE Given I = A, A ? , R, R ?…”

Section: Complexitymentioning

confidence: 99%