Francesca Toni

Francesca Toni

Auto-generated profile, based on publicly available information

Francesca Toni

Department of Computing, Imperial College London, UK

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 1992 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
AKA. C. Kakas
A. C. Kakas
RKR. A. Kowalski
R. A. Kowalski
FTF. Toni
F. Toni
This paper is a survey and critical overview of recent work on the extension of logic programming to perform abductive reasoning (abductive logic programming). We outline the general framework of abduction and its applications to knowledge assimilation and default reasoning; and we introduce an argumentation-theoretic approach to the use of abduction as an interpretation for negation as failure. We also analyse the links between abduction and the extension of logic programming obtained by adding a form of explicit negation. Finally we discuss the relation between abduction and truth maintenance.

2 January 2014 in Argument & Computation
Verified
Journal Article
Open access
PDF file
FTFrancesca Toni
Francesca Toni
We give an introductory tutorial to assumption-based argumentation (referred to as ABA) – a form of argumentation where arguments and attacks are notions derived from primitive notions of rules in a deductive system, assumptions and contraries thereof. ABA is equipped with different semantics for determining ‘winning’ sets of assumptions and – interchangeably and equivalently – ‘winning’ sets of arguments. It is also equipped with a catalogue of computational techniques to determine whether given conclusions can be supported by a ‘winning’ set of arguments. These are in the form of disputes between (fictional) proponent and opponent players, provably correct w.r.t. the semantics. Albeit simple, ABA is powerful in that it can be used to represent and reason with a number of problems in AI and beyond: non-monotonic reasoning, preferences, decisions. While doing so, it encompasses the expressive and computational needs of these problems while affording the transparency and explanatory power of argumentation.

2 January 2014 in Argument & Computation
Verified
Journal Article
Open access
PDF file
PBPhilippe Besnard
Philippe Besnard
AGAlejandro Garcia
Alejandro Garcia
AHAnthony Hunter
Anthony Hunter
SMSanjay Modgil
Sanjay Modgil
HPHenry Prakken
Henry Prakken
FTFrancesca Toni
Francesca Toni
In abstract argumentation, each argument is regarded as atomic. There is no internal structure to an argument. Also, there is no specification of what is an argument or an attack. They are assumed to be given. This abstract perspective provides many advantages for studying the nature of argumentation, but it does not cover all our needs for understanding argumentation or for building tools for supporting or undertaking argumentation. If we want a more detailed formalisation of arguments than is available with abstract argumentation, we can turn to structured argumentation, which is the topic of this special issue of Argument and Computation. In structured argumentation, we assume a formal language for representing knowledge, and specifying how arguments and counterarguments can be constructed from that knowledge. An argument is then said to be structured in the sense that normally the premises and claim of the argument are made explicit, and the relationship between the premises and claim is formally defined (for instance using logical entailment). In this introduction, we provide a brief overview of the approaches covered in this special issue on structured argumentation.

2 January 2015 in Argument & Computation
Verified
Journal Article
Open access
PDF file
PBPietro Baroni
Pietro Baroni
MRMarco Romano
Marco Romano
FTFrancesca Toni
Francesca Toni
MAMarco Aurisicchio
Marco Aurisicchio
GBGiorgio Bertanza
Giorgio Bertanza
This paper presents a novel argumentation framework to support Issue-Based Information System style debates on design alternatives, by providing an automatic quantitative evaluation of the positions put forward. It also identifies several formal prop

15 March 2006 in Journal of Artificial Intelligence Research
Verified
Journal Article
Open access
PDF file
UEU. Endriss
U. Endriss
NMN. Maudet
N. Maudet
FSF. Sadri
F. Sadri
FTF. Toni
F. Toni
A multiagent system may be thought of as an artificial society of autonomous software agents and we can apply concepts borrowed from welfare economics and social choice theory to assess the social welfare of such an agent society. In this paper, we study an abstract negotiation framework where agents can agree on multilateral deals to exchange bundles of indivisible resources. We then analyse how these deals affect social welfare for different instances of the basic framework and different interpretations of the concept of social welfare itself. In particular, we show how certain classes of deals are both sufficient and necessary to guarantee that a socially optimal allocation of resources will be reached eventually.

1 August 1999 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
KKKc Kakas
Kc Kakas
FTF Toni
F Toni
In recent years, argumentation has been shown to be an appropriate framework in which logic programming with negation as failure as well as other logics for non-monotonic reasoning can be encompassed. Many of the existing semantics for negation as failure in logic programming can be understood in a uniform way using argumentation. Moreover, other logics for non-monotonic reasoning that can also be formulated via argumentation can be given new semantics, by a direct extension of the logic programming semantics. In this paper we develop an abstract computational framework where various argumentation semantics can be computed via different parametric variations of a simple basic proof theory. This proof theory is given in terms of derivations of trees where each node in a tree contains an argument (or attack) against its corresponding parent node. The proposed proof theory, defined here for the case of logic programming, generalizes directly to other logics for non-monotonic reasoning that can also be formalized via argumentation. The abstract proof theory forms the basis for developing concrete top-down proof procedures for query evaluation. These proof procedures are obtained by adopting specific search strategies and ways of computing attacks in the particular argumentation framework. For logic programming these procedures can be seen as a generalization of the Eshghi-Kowalski abductive proof procedure that in turn generalizes SLDNF.