Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
The Burden of Persuasion in Abstract Argumentation
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Interactive and Intelligent Systems Group)ORCID iD: 0000-0002-6458-2252
King’s College London, London, UK; University of Luxembourg, Esch-sur-Alzette, Luxembourg; Bar Ilan University, Ramat Gan, Israel.
European University Institute, Florence, Italy; Università di Bologna, Bologna, Italy.
2021 (English)In: Logic and Argumentation: 4th International Conference, CLAR 2021, Hangzhou, China, October 20–22, 2021, Proceedings / [ed] Pietro Baroni, Christoph Benzmüller and Yὶ N. Wang, Springer, 2021, p. 224-243Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we provide a formal framework for modeling the burden of persuasion in legal reasoning. The framework is based on abstract argumentation, a frequently studied method of non-monotonic reasoning, and can be applied to different argumentation semantics; it supports burdens of persuasion with arbitrary many levels, and allows for the placement of a burden of persuasion on any subset of an argumentation framework's arguments. Our framework can be considered an extension of related works that raise questions on how burdens of persuasion should be handled in some conflict scenarios that can be modeled with abstract argumentation. An open source software implementation of the introduced formal notions is available as an extension of an argumentation reasoning library.

Place, publisher, year, edition, pages
Springer, 2021. p. 224-243
Series
Lecture Notes in Computer Science (LNCS), ISSN 0302-9743, E-ISSN 1611-3349 ; 13040
Keywords [en]
Formal argumentation, Non-monotonic reasoning, Legal reasoning
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-188625DOI: 10.1007/978-3-030-89391-0_13ISI: 000754548600013Scopus ID: 2-s2.0-85118142754ISBN: 978-3-030-89391-0 (electronic)ISBN: 978-3-030-89390-3 (print)OAI: oai:DiVA.org:umu-188625DiVA, id: diva2:1603641
Conference
CLAR 2021 - Fourth International Conference on Logic and Argumentation, Hybrid (virtual and physical), via Hangzhou, China, October 20-22, 2021
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2021-10-16 Created: 2021-10-16 Last updated: 2023-09-05Bibliographically approved
In thesis
1. Principle-based non-monotonic reasoning - from humans to machines
Open this publication in new window or tab >>Principle-based non-monotonic reasoning - from humans to machines
2022 (English)Doctoral thesis, comprehensive summary (Other academic)
Alternative title[sv]
Principbaserat icke-monotoniskt resonemang - från människor till maskiner
Abstract [en]

A key challenge when developing intelligent agents is to instill behavior into computing systems that can be considered as intelligent from a common-sense perspective. Such behavior requires agents to diverge from typical decision-making algorithms that strive to maximize simple and often one-dimensional metrics. A striking parallel to this research problemcan be found in the design of formal models of human decision-making in microeconomic theory. Traditionally, mathematical models of human decision-making also reflect the ambition to maximize expected utility or a preference function, which economists refer to as the rational man paradigm. However, evidence suggests that these models are flawed, not only because human decision-making is subject to systematic fallacies, but also because the models depend on assumptions that do not hold in reality. Consequently, the research domain of formally modeling bounded rationality emerged, which attempts to account for these shortcomings by systematically relaxing the mathematical constraints of the formal model of economic rationality. Similarly, in the field of symbolic reasoning, approaches have emerged to systematically relax the notion of monotony of entailment, which stipulates (colloquially speaking) that when inferring a set of statements from a knowledge base, the addition of new knowledge to the knowledge base must not lead to the rejection of any of the previously inferred statements.

By drawing from these developments in microeconomic theory and symbolic reasoning, this thesis explores different principle-based approaches to decision-making and non-monotonic reasoning. Thereby, abstract argumentation is used as a fundamental method for reasoning in face of conflicting knowledge (or: beliefs) that reduces non-monotonic reasoning to the problem of drawing conclusions (extensions) from a directed graph, and hence provides a neat abstraction for theoretical exploration. In particular, the works collected in this thesis i) introduce the consistent preferences property of microeconomic theory, as well as some relaxed forms of monotony of entailment as mathematical principles to abstract argumentation-based inference; ii) show how to enforce some of these principles in dynamic environments; iii) devise a formal approach to maximize monotony of entailment, given the constraints imposed by an inference function; iv) extend and apply the aforementioned approaches to the domains of machine reasoning explainability and legal reasoning.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2022. p. 34
Series
Report / UMINF, ISSN 0348-0542 ; 22.02
Keywords
Non-monotonic reasoning, formal argumentation
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-193460 (URN)978-91-7855-757-8 (ISBN)978-91-7855-758-5 (ISBN)
Public defence
2022-04-29, MA121 (MIT-huset), Umeå University, Umeå, 13:15 (English)
Opponent
Supervisors
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Note

Digital ISBN missing in publication. 

Available from: 2022-04-08 Created: 2022-04-02 Last updated: 2022-04-04Bibliographically approved

Open Access in DiVA

fulltext(456 kB)329 downloads
File information
File name FULLTEXT01.pdfFile size 456 kBChecksum SHA-512
1e2725cfee74038aa4d141cd11728e82a560952a8455b56325f86d9575d4a1cdfca1e0d1facc50d4251203c19af841a7d22071bf0136cb04f6e5d8036d88841c
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Kampik, Timotheus
By organisation
Department of Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 330 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
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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