A logic of defeasible argumentation: Constructing arguments in justification logic

Argument and Computation 13 (1):3-47 (2022)
  Copy   BIBTEX

Abstract

In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a logic of structured defeasible arguments using the language of justification logic. In this logic, we introduce defeasible justification assertions of the type t : F that read as “t is a defeasible reason that justifies F”. Such formulas are then interpreted as arguments and their acceptance semantics is given in analogy to Dung’s abstract argumentation framework semantics. We show that a large subclass of Dung’s frameworks that we call “warranted” frameworks is a special case of our logic in the sense that Dung’s frameworks can be obtained from justification logic-based theories by focusing on a single aspect of attacks among justification logic arguments and Dung’s warranted frameworks always have multiple justification logic instantiations called “realizations”. We first define a new justification logic that relies on operational semantics for default logic. One of the key features that is absent in standard justification logics is the possibility to weigh different epistemic reasons or pieces of evidence that might conflict with one another. To amend this, we develop a semantics for “defeaters”: conflicting reasons forming a basis to doubt the original conclusion or to believe an opposite statement. This enables us to formalize non-monotonic justifications that prompt extension revision already for normal default theories. Then we present our logic as a system for abstract argumentation with structured arguments. The format of conflicting reasons overlaps with the idea of attacks between arguments to the extent that it is possible to define all the standard notions of argumentation framework extensions. Using the definitions of extensions, we establish formal correspondence between Dung’s original argumentation semantics and our operational semantics for default theories. One of the results shows that the notorious attack cycles from abstract argumentation cannot always be realized as justification logic default theories.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,297

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Structured argumentation dynamics: Undermining attacks in default justification logic.Stipe Pandžić - 2022 - Annals of Mathematics and Artificial Intelligence 90 (2-3):297-337.
Initial sets in abstract argumentation frameworks.Yuming Xu & Claudette Cayrol - 2018 - Journal of Applied Non-Classical Logics 28 (2-3):260-279.
Abstract argumentation.Robert A. Kowalski & Francesca Toni - 1996 - Artificial Intelligence and Law 4 (3-4):275-296.
Abduction in argumentation frameworks.Chiaki Sakama - 2018 - Journal of Applied Non-Classical Logics 28 (2-3):218-239.

Analytics

Added to PP
2020-12-30

Downloads
105 (#173,783)

6 months
34 (#119,499)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stipe Pandžić
Utrecht University

Citations of this work

No citations found.

Add more citations