Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 150448099 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Skiba%2C+Kenneth%22">Skiba, Kenneth</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Neugebauer%2C+Daniel%22">Neugebauer, Daniel</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Rothe%2C+Jorg%22">Rothe, Jorg</searchLink><relatesTo>2</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22IEEE+Intelligent+Systems%22">IEEE Intelligent Systems</searchLink>. Mar/Apr2021, Vol. 36 Issue 2, p13-24. 12p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Artificial+intelligence%22">Artificial intelligence</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Generalization%22">Generalization</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=150448099 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/MIS.2020.3046782 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 13 Subjects: – SubjectFull: Computational complexity Type: general – SubjectFull: Artificial intelligence Type: general – SubjectFull: Semantics Type: general – SubjectFull: Generalization Type: general Titles: – TitleFull: Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Skiba, Kenneth – PersonEntity: Name: NameFull: Neugebauer, Daniel – PersonEntity: Name: NameFull: Rothe, Jorg IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar/Apr2021 Type: published Y: 2021 Identifiers: – Type: issn-print Value: 15411672 Numbering: – Type: volume Value: 36 – Type: issue Value: 2 Titles: – TitleFull: IEEE Intelligent Systems Type: main |
| ResultId | 1 |
