On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics

Abstract dialectical frameworks (ADFs) are a recently introduced powerful generalization of Dung’s popular abstract argumentation frameworks (AFs). Inspired by similar work for AFs, we introduce a decomposition scheme for ADFs, which proceeds along the ADF’s strongly connected components. We find th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of artificial intelligence research Jg. 70; S. 1 - 64
Hauptverfasser: Gaggl, Sarah Alice, Rudolph, Sebastian, Straß, Hannes
Format: Journal Article
Sprache:Englisch
Veröffentlicht: San Francisco AI Access Foundation 01.01.2021
Schlagworte:
Artificial intelligence
Boolean algebra
Complexity
Decomposition
Dialectics
Dung
Logic programs
Polynomials
Semantics
ISSN:1076-9757, 1076-9757, 1943-5037
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Abstract dialectical frameworks (ADFs) are a recently introduced powerful generalization of Dung’s popular abstract argumentation frameworks (AFs). Inspired by similar work for AFs, we introduce a decomposition scheme for ADFs, which proceeds along the ADF’s strongly connected components. We find that, for several semantics, the decompositionbased version coincides with the original semantics, whereas for others, it gives rise to a new semantics. These new semantics allow us to deal with pertinent problems such as odd-length negative cycles in a more general setting, that for instance also encompasses logic programs. We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics. The results are quite interesting, for some of them involve little-known classes of the so-called Boolean hierarchy (another hierarchy in between classes of the polynomial hierarchy). Furthermore, in credulous and sceptical entailment, the complexity can be different depending on whether we check for truth or falsity of a specific statement.
AbstractList Abstract dialectical frameworks (ADFs) are a recently introduced powerful generalization of Dung’s popular abstract argumentation frameworks (AFs). Inspired by similar work for AFs, we introduce a decomposition scheme for ADFs, which proceeds along the ADF’s strongly connected components. We find that, for several semantics, the decompositionbased version coincides with the original semantics, whereas for others, it gives rise to a new semantics. These new semantics allow us to deal with pertinent problems such as odd-length negative cycles in a more general setting, that for instance also encompasses logic programs. We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics. The results are quite interesting, for some of them involve little-known classes of the so-called Boolean hierarchy (another hierarchy in between classes of the polynomial hierarchy). Furthermore, in credulous and sceptical entailment, the complexity can be different depending on whether we check for truth or falsity of a specific statement.
Abstract dialectical frameworks (ADFs) are a recently introduced powerful generalization of Dung’s popular abstract argumentation frameworks (AFs). Inspired by similar work for AFs, we introduce a decomposition scheme for ADFs, which proceeds along the ADF’s strongly connected components. We find that, for several semantics, the decomposition-based version coincides with the original semantics, whereas for others, it gives rise to a new semantics. These new semantics allow us to deal with pertinent problems such as odd-length negative cycles in a more general setting, that for instance also encompasses logic programs. We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics. The results are quite interesting, for some of them involve little-known classes of the so-called Boolean hierarchy (another hierarchy in between classes of the polynomial hierarchy). Furthermore, in credulous and sceptical entailment, the complexity can be different depending on whether we check for truth or falsity of a specific statement.
Author Gaggl, Sarah Alice
Rudolph, Sebastian
Straß, Hannes
Author_xml – sequence: 1
  givenname: Sarah Alice
  surname: Gaggl
  fullname: Gaggl, Sarah Alice
– sequence: 2
  givenname: Sebastian
  surname: Rudolph
  fullname: Rudolph, Sebastian
– sequence: 3
  givenname: Hannes
  surname: Straß
  fullname: Straß, Hannes
BookMark eNptkE1PAjEQQBuDiYDe_AFNvLrY6X4fCYiaEDmo52a27cbissW2qPx7d8GDMZ5mDu_NJG9EBq1tNSGXwCaQQXyzRuMmMAGIk-KEDIHlWVTmaT74tZ-RkfdrxqBMeDEkctXS8KrpXEu72VpvgrEttTWdVj44lIHODTZaBiOxoQuHG_1p3Zun2KqDOOu0Rn-ZsO-tRzQfOqrQa0Wf9AbbzvPn5LTGxuuLnzkmL4vb59l9tFzdPcymy0jGDEKU1DwDwLTOyhyUknmBJcpKygRLnWQStdRYMajTjBWqLriSCdOs4LLKFKo0HpOr492ts-877YNY251ru5eCp2nMkxI4dNT1kZLOeu90LbbObNDtBTDRZxR9RgHikLHD-R9cmoB9pS6Paf6XvgHDf3qv
CitedBy_id crossref_primary_10_1038_s41524_023_01048_x
crossref_primary_10_1093_logcom_exad079
crossref_primary_10_1016_j_artint_2022_103697
ContentType Journal Article
Copyright 2021. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about
Copyright_xml – notice: 2021. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about
DBID AAYXX
CITATION
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOI 10.1613/jair.1.11348
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle CrossRef
Publicly Available Content Database
Advanced Technologies & Aerospace Collection
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1076-9757
1943-5037
EndPage 64
ExternalDocumentID 10_1613_jair_1_11348
GroupedDBID .DC
29J
2WC
5GY
5VS
AAKMM
AAKPC
AALFJ
AAYFX
AAYXX
ACGFO
ACM
ADBBV
ADBSK
ADMLS
AEFXT
AEJOY
AENEX
AFFHD
AFKRA
AFWXC
AKRVB
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARAPS
BCNDV
BENPR
BGLVJ
CCPQU
CITATION
E3Z
EBS
EJD
F5P
FRJ
FRP
GROUPED_DOAJ
GUFHI
HCIFZ
K7-
KQ8
LHSKQ
LPJ
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
RNS
TR2
XSB
8FE
8FG
ABUWG
AZQEC
DWQXO
GNUQQ
JQ2
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
PUEGO
ID FETCH-LOGICAL-c301t-4f2611a5f6971ddc78a9acbcc4a9e46caeceab01f5608df82dc40e082cb6dad53
IEDL.DBID K7-
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000609637900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1076-9757
IngestDate Sun Sep 07 05:31:45 EDT 2025
Sat Nov 29 05:27:06 EST 2025
Tue Nov 18 22:25:57 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c301t-4f2611a5f6971ddc78a9acbcc4a9e46caeceab01f5608df82dc40e082cb6dad53
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2553249121?pq-origsite=%requestingapplication%
PQID 2553249121
PQPubID 5160723
PageCount 64
ParticipantIDs proquest_journals_2553249121
crossref_primary_10_1613_jair_1_11348
crossref_citationtrail_10_1613_jair_1_11348
PublicationCentury 2000
PublicationDate 2021-01-01
PublicationDateYYYYMMDD 2021-01-01
PublicationDate_xml – month: 01
  year: 2021
  text: 2021-01-01
  day: 01
PublicationDecade 2020
PublicationPlace San Francisco
PublicationPlace_xml – name: San Francisco
PublicationTitle The Journal of artificial intelligence research
PublicationYear 2021
Publisher AI Access Foundation
Publisher_xml – name: AI Access Foundation
SSID ssj0019428
Score 2.392548
Snippet Abstract dialectical frameworks (ADFs) are a recently introduced powerful generalization of Dung’s popular abstract argumentation frameworks (AFs). Inspired by...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 1
SubjectTerms Artificial intelligence
Boolean algebra
Complexity
Decomposition
Dialectics
Dung
Logic programs
Polynomials
Semantics
Title On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
URI https://www.proquest.com/docview/2553249121
Volume 70
WOSCitedRecordID wos000609637900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1076-9757
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0019428
  issn: 1076-9757
  databaseCode: DOA
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1076-9757
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0019428
  issn: 1076-9757
  databaseCode: K7-
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1076-9757
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0019428
  issn: 1076-9757
  databaseCode: BENPR
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1076-9757
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0019428
  issn: 1076-9757
  databaseCode: PIMPY
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV05T8MwFLa4BhZuRDkqDzAhQ526STwhrgoGSsUhwRQ5z45UBCk0AYl_z3upwzHAwpIhsaMon_1uv4-x7dgo6gqnBaCyFApsRoeVpYCUmrmBbFs7JpuIer347k73fcCt8GWVtUysBLUdAsXI99H0Rd2vZSAPnl8EsUZRdtVTaEyyaRmgEKakbCQ-swhaBeOjcFEodNSJfOE7arD9BzMY7UliNCHmn-8q6adErtRMd_6_H7jA5ryByQ_HK2KRTbh8ic3X5A3c7-VlBpc5R-OPnziqKvelW3yY8cOUoh9Q8hNcmiQOEUXerWu4Cm5yW02kV1I3zfKdZvUMik1BOtHya_eEeA2gWGG33dOb4zPhGRcE4EYvhcrQoZKmk4U6ktZCFBttIAVQRjsVgnHgTNqSGdpJsc3iwIJqObQiIA2tsZ32KpvKh7lbY7xjo1Zm0RnUDlRbqTRsp3iNnaWOgzptsN36pyfg25ETK8ZjQm4JQpQQRIlMKogabOdz9PO4Dccv4zZrcBK_GYvkC5n1vx9vsNmASlaqCMsmmypHr26LzcBbOShGTTZ9dNrrXzUrt71ZrTS81z-_6N9_AKp73bg
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB1VBam9sEBbtVDAh_ZUuV1nvXF8QKhiWbXasiC1lXpLnbEjLYJs2QTQ_il-IzP5KHCAWw-95BLbUuLneTP2eB7AXuI0V4WzEokspUaf82VlJTHjYm6oBt43YhNmOk2uruzHFfjZ3YXhtMrOJtaG2s-R98iPyPUl7rcqUm9uvkpWjeLT1U5Co4HFJCx_UMhWvj4d0fzuR9H43cXbE9mqCkgkMFdS5xQ0KDfMY2uU92gSZx1miNrZoGN0AYPL-ionXyDxeRJ51P1ATIlZ7J1nlQgy-Q_0IDG8riZG3p5aWB01V-9MLK0ZmjbRnhjz6JObLQ4VK6iw0tCfFPg3A9S0Nu7dtx_yGB61DrQ4bhD_BFZC8RR6nTiFaG3VBuCHQpBzK0aBs-bb1DQxz8Vxxrs7WIkRLT0294RSMe5y1ErhCl935CG5Wmi15F5TR7QgmfO9OA9fCI8zLDfh8k4-dQtWi3kRtkEMvennnoJdG1APtM7iQUbPJHiuqGizHTjoJjnFttw6q358TjnsIkikDIlUpTUkdmD_tvVNU2bkH-12OzCkrbEp099IePb_169g7eTi_Vl6djqdPIf1iNNz6t2kXVitFt_CC3iI36tZuXhZ41rA9V3j5hdeQjp0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Decomposition+of+Abstract+Dialectical+Frameworks+and+the+Complexity+of+Naive-based+Semantics&rft.jtitle=The+Journal+of+artificial+intelligence+research&rft.au=Gaggl%2C+Sarah+Alice&rft.au=Rudolph%2C+Sebastian&rft.au=Stra%C3%9F%2C+Hannes&rft.date=2021-01-01&rft.pub=AI+Access+Foundation&rft.issn=1076-9757&rft.eissn=1943-5037&rft.volume=70&rft.spage=1&rft_id=info:doi/10.1613%2Fjair.1.11348
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1076-9757&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1076-9757&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1076-9757&client=summon