An Abstract, Argumentation-Theoretic Approach to Default Reasoning
Computing ideal sceptical argumentation
The role of abduction in logic programming
The general framework of Abduction and its applications to Knowledge Assimilation and Default Reasoning is outlined; the argumentation-theoretic approach to the use of abduction as an interpretation for Negation as Failure is described.
Compared with a number of existing approaches to non-abstract argumentation, ABA does not have explicit rebuttals and does not impose the restriction that arguments have consistent and minimal supports, but to a large extent, rebuttals can be obtained “for.
A tutorial on assumption-based argumentation
- Francesca Toni
- Computer ScienceArgument Comput.
- 11 February 2014
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…
Dialectic proof procedures for assumption-based, admissible argumentation
A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
A measure of argument strength is formalised by applying the concept of value of a game, as defined in Game Theory (von Neumann 1928), which satisfies a number of intuitively appealing properties that can be derived mathematically from the minimax theorem.
Negotiating Socially Optimal Allocations of Resources
- U. Endriss, N. Maudet, F. Sadri, Francesca Toni
- EconomicsJournal of Artificial Intelligence Research
- 28 September 2011
This paper studies an abstract negotiation framework where agents can agree on multilateral deals to exchange bundles of indivisible resources and shows how certain classes of deals are both sufficient and necessary to guarantee that a socially optimal allocation of resources will be reached eventually.
An Assumption-Based Framework for Non-Monotonic Reasoning
- A. Bondarenko, Francesca Toni, R. Kowalski
- Computer ScienceInternational Conference on Logic Programming and…
- 1 June 1993
The paper investigates applications of the framework to logic programming , abductive logic programming, logic programs extended with \classi-cal" negation, default logic, autoepistemic logic, and non-monotonic modal logic.
Computing Argumentation in Logic Programming
An abstract computational framework where various argumen-tation semantics can be computed via diierent parametric variations of a simple basic proof theory is developed, given in terms of derivations of trees where each node in a tree contains an argument against its corresponding parent node.