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
Explanations of Non-monotonic Inference in Admissibility-Based Abstract Argumentation
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Interactive and Intelligent Systems Group)ORCID iD: 0000-0002-6458-2252
Ericsson Research, Stockholm, Sweden.
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, Cham: Springer, 2021, p. 209-223Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we introduce a formal framework for explaining change of inference in abstract argumentation, in particular in the context of iteratively drawing inferences from a sequence of normal expansions, with a focus on admissible set-based semantics. We then conduct a formal analysis, showing that given an initial argumentation framework and an extension that has been inferred from it, we can guarantee the existence of explanation arguments for the violation of monotony when inferring an extension from a normal expansion of the initial argumentation framework.

Place, publisher, year, edition, pages
Cham: Springer, 2021. p. 209-223
Series
Lecture Notes in Computer Science (LNCS), ISSN 0302-9743, E-ISSN 1611-3349 ; 13040
Keywords [en]
Formal argumentation, Explainable artificial intelligence, Non-monotonic reasoning
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-188626DOI: 10.1007/978-3-030-89391-0_12ISI: 000754548600012Scopus ID: 2-s2.0-85118111656ISBN: 978-3-030-89391-0 (electronic)ISBN: 978-3-030-89390-3 (print)OAI: oai:DiVA.org:umu-188626DiVA, id: diva2:1603642
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(415 kB)269 downloads
File information
File name FULLTEXT01.pdfFile size 415 kBChecksum SHA-512
fd2148ad2e7aff09fc812d60321c17730ce43868cf4aa6b6739e67bc874b5e6bfc2b86cc5a77429ddfa840dd9c77f1e38e98227ca51f24c3a798ccd9134b2bf5
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: 270 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: 509 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