Bibliographic Details
| Title: |
Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks. |
| Authors: |
Skiba, Kenneth1 (AUTHOR), Neugebauer, Daniel2 (AUTHOR), Rothe, Jorg2 (AUTHOR) |
| Source: |
IEEE Intelligent Systems. Mar/Apr2021, Vol. 36 Issue 2, p13-24. 12p. |
| Subjects: |
Computational complexity, Artificial intelligence, Semantics, Generalization |
| Abstract: |
Abstract argumentation frameworks (AFs) are a prevailing model for the formal representation of argumentations in AI research. The generalized model of incomplete AFs extends the basic model by allowing for the representation of unquantified uncertainty about the existence of elements in an argumentation. For this extended model of AFs, we formally define a natural generalization of the nonempty existence problem, which asks whether there exists a nonempty set of arguments satisfying the conditions specified by a given semantics. Focusing on the fundamental semantics for incomplete AFs and considering a possible and a necessary variant of the nonempty existence problem, this yields a family of related problems, and we provide a full analysis of their computational complexity. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Intelligent Systems is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
