Argumentation Semantics for Defeasible Logic

  • Authors:

  • Guido Governatori;Michael J. Maher;Grigoris Antoniou;David Billington

  • Affiliations:

  • School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD 4072, Australia. E-mail: guido@itee.uq.edu.au;National ICT Australia, C/o School of Computer Science and Engineering, University of New South Wales, Sydney, NSW 2052, Australia. E-mail: mmaher@cse.unsw.ed.au;Institute of Computer Science, FORTH, PO Box 1385, 71110 Heraklion, Crete, Greece. E-mail: antoniou@ics.forth.edu;Institute of Computer Science, FORTH, PO Box 1385, 71110 Heraklion, Crete, Greece. E-mail: antoniou@ics.forth.edu

  • Venue:
  • Journal of Logic and Computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. This paper establishes significant links between defeasible reasoning and argumentation. In particular, Dung-like argumentation semantics is provided for two key defeasible logics, of which one is ambiguity propagating and the other ambiguity blocking. There are several reasons for the significance of this work: (a) establishing links between formal systems leads to a better understanding and cross-fertilization, in particular our work sheds light on the argumentation-theoretic features of defeasible logic; (b) we provide the first ambiguity blocking Dung-like argumentation system; (c) defeasible reasoning may provide an efficient implementation platform for systems of argumentation; and (d) argumentation-based semantics support a deeper understanding of defeasible reasoning, especially in the context of the intended applications.