Author name cluster

Marcello D'Agostino

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers

2 author rows

FLAP Journal 2023 Journal Article

Advancing the Boundaries of Formal Argumentation: Reflections on the AI 3 2021 Special Issue.

Marcello D'Agostino
Fabio Aurelio D'Asaro
Costanza Larese

This article reflects on the Special Issue based on invited papers from the 5th Workshop on Advances in Argumentation in Artificial Intelligence (AI 3 2021 ), showcasing the latest advancements in the field made by the Italian community on argumentation, as well as other researchers worldwide. This Special Issue highlights the importance of advancing logical-based AI approaches, such as formal argumentation, in the continuously expanding landscape of Artificial Intelligence. Papers in this Special Issue cover a diverse range of topics, including argument game-based proof theories, analysis of legal cases, decomposability in abstract argumentation, meta-argumentation approaches, explanations for model outputs using causal models, representation of natural argumentative discourse, and Paraconsistent Weak Kleene logic-based belief revision. By emphasizing these innovative research contributions, this article underscores the need for continued progress in the field of Formal Argumentation to complement and enhance the ongoing developments in AI.

PDF Details

FLAP Journal 2021 Journal Article

Towards Depth-bounded Natural Deduction for Classical First-order Logic.

Marcello D'Agostino
Costanza Larese
Sanjay Modgil

In this paper we lay the foundations of a new proof-theory for classical first-order logic that allows for a natural characterization of a notion of inferential depth. The approach we propose here aims towards extending the proof-theoretical framework presented in [6] by combining it with some ideas inspired by Hintikka’s work [18]. Unlike standard natural deduction, in this framework the inference rules that fix the meaning of the logical operators are symmetrical with respect to assent and dissent and do not involve the discharge of formulas. The only discharge rule is a classical dilemma rule whose nested applications provide a sensible measure of inferential depth. The result is a hierarchy of decidable depth-bounded approximations of classical first-order logic that expands the hierarchy of tractable approximations of Boolean logic investigated in [11, 10, 7].

Details

IJCAI Conference 2020 Conference Paper

A Fully Rational Account of Structured Argumentation Under Resource Bounds

Marcello D'Agostino
Sanjay Modgil

ASPIC+ is an established general framework for argumentation and non-monotonic reasoning. However, ASPIC+ does not satisfy the non-contamination rationality postulates, and moreover, tacitly assumes unbounded resources when demonstrating satisfaction of the consistency postulates. In this paper we present a new version of ASPIC+ – Dialectial ASPIC+ – that is fully rational under resource bounds.

PDF Details DOI

IJCAI Conference 2018 Conference Paper

A Study of Argumentative Characterisations of Preferred Subtheories

Marcello D'Agostino
Sanjay Modgil

Classical logic argumentation (Cl-Arg) under the stable semantics yields argumentative characterisations of non-monotonic inference in Preferred Subtheories. This paper studies these characterisations under both the standard approach to Cl-Arg, and a recent dialectical approach that is provably rational under resource bounds. Two key contributions are made. Firstly, the preferred extensions are shown to coincide with the stable extensions. This means that algorithms and proof theories for the admissible semantics can now be used to decide credulous inference in Preferred Subtheories. Secondly, we show that as compared with the standard approach, the grounded semantics applied to the dialectical approach more closely approximates sceptical inference in Preferred Subtheories.

PDF Details

ECAI Conference 2016 Conference Paper

A Rational Account of Classical Logic Argumentation for Real-World Agents

Marcello D'Agostino
Sanjay Modgil

Classical logic based argumentation (ClAr) characterises single agent non-monotonic reasoning and enables distributed non-monotonic reasoning amongst agents in dialogues. However, features of ClAr that have been shown sufficient to ensure satisfaction of rationality postulates, preclude their use by resource bounded agents reasoning individually, or dialectically in real-world dialogue. This paper provides a new formalisation of ClAr that is both suitable for such uses and satisfies the rationality postulates. We illustrate by providing a rational dialectical characterisation of Brewka's non-monotonic Preferred Subtheories defined under the assumption of restricted inferential capabilities.

Details

TCS Journal 2015 Journal Article

An informational view of classical logic

Marcello D'Agostino

We present an informational view of classical propositional logic that stems from a kind of informational semantics whereby the meaning of a logical operator is specified solely in terms of the information that is actually possessed by an agent. In this view the inferential power of logical agents is naturally bounded by their limited capability of manipulating “virtual information”, namely information that is not implicitly contained in the data. Although this informational semantics cannot be expressed by any finitely-valued matrix, it can be expressed by a non-deterministic 3-valued matrix that was first introduced by W. V. O. Quine, but ignored by the logical community. Within the general framework presented in [21] we provide an in-depth discussion of this informational semantics and a detailed analysis of a specific infinite hierarchy of tractable approximations to classical propositional logic that is based on it. This hierarchy can be used to model the inferential power of resource-bounded agents and admits of a uniform proof-theoretical characterization that is half-way between a classical version of Natural Deduction and the method of semantic tableaux.

Details DOI