Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Set contribution functions for quantitative bipolar argumentation and their principles
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0009-0001-8354-6265
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0001-9379-4281
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0002-0368-8037
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0002-6458-2252
2026 (English)In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 194, article id 109673Article in journal (Refereed) Published
Abstract [en]

We present functions that quantify the contribution of a set of arguments in quantitative bipolar argumentation graphs to (the final strength of) an argument of interest—a so-called topic. Our set contribution functions are generalizations of existing functions that quantify the contribution of a single contributing argument to a topic. Accordingly, we generalize existing contribution function principles for set contribution functions and provide a corresponding principle-based analysis. We introduce new principles specific to set-based functions that focus on properties pertaining to the interaction of arguments within a set. Finally, we sketch how the principles play out across different set contribution functions given a recommendation system application scenario.

Place, publisher, year, edition, pages
Elsevier, 2026. Vol. 194, article id 109673
Keywords [en]
Quantitative argumentation, Explainable AI, Automated reasoning
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-252353DOI: 10.1016/j.ijar.2026.109673ISI: 001732493500001Scopus ID: 2-s2.0-105035005481OAI: oai:DiVA.org:umu-252353DiVA, id: diva2:2055259
Funder
Knut and Alice Wallenberg FoundationWallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2026-04-23 Created: 2026-04-23 Last updated: 2026-04-23Bibliographically approved

Open Access in DiVA

fulltext(9976 kB)21 downloads
File information
File name FULLTEXT02.pdfFile size 9976 kBChecksum SHA-512
f5d792c45b916cbb7ef15a57c96ec5d69edf141dbff88f0402a09c29407966bf0a86a211fe3066c91656ac0e589724c922c0e490cd35d55f539b4d2f6cdb95b9
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Naudot, FilipBrännström, AndreasTorra, VicençKampik, Timotheus

Search in DiVA

By author/editor
Naudot, FilipBrännström, AndreasTorra, VicençKampik, Timotheus
By organisation
Department of Computing Science
In the same journal
International Journal of Approximate Reasoning
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 21 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 182 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf