• Publications
  • Influence
An Abstract, Argumentation-Theoretic Approach to Default Reasoning
An abstract framework for default reasoning, which includes Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logics, and certain instances of circumscription as special cases, is presented and a more liberal, argumentation-theoretic semantics is proposed, based upon the notion of admissible extension in logic programming. Expand
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. Expand
Computing ideal sceptical argumentation
Two dialectic procedures for the sceptical ideal semantics for argumentation are presented, defined in terms of dispute trees, for abstract argumentation frameworks and a variant of the procedure of [P.A. Kowalski, F. Toni, Dialectic proof procedures for assumption-based, admissible argumentation, Artificial Intelligence 170 (2006) 114-159] is presented. Expand
Assumption-Based Argumentation
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. Expand
A tutorial on assumption-based argumentation
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 aExpand
Dialectic proof procedures for assumption-based, admissible argumentation
A family of dialectic proof procedures for the admissibility semantics of assumption-based argumentation using backward reasoning to construct arguments and potential arguments and the fact that the proponent and opponent can attack one another before an argument is completed. Expand
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. Expand
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. Expand
Negotiating Socially Optimal Allocations of Resources
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. Expand
On the computational complexity of assumption-based argumentation for default reasoning
This paper analyzes the computational complexity of credulous and sceptical reasoning under the semantics of admissible and preferred arguments for (the propositional variant of) the instances of the abstract framework capturing theorist, circumscription, logic programming, default logic, and autoepistemic logic. Expand