Argumentation Semantics for Defeasible Logics

G. Governatori, M. J. Maher, G. Antoniou, D. Billington

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)


Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation-based semantics for defeasible logic. Recently it has been shown that a family of approaches can be built around defeasible logic, in which different intuitions can be followed. In this paper we present an argumentation-based semantics for an ambiguity propagating logic, too. Further defeasible logics can be characterised in a similar way.

Original languageEnglish
Title of host publicationPRICAI 2000, Topics in Artificial Intelligence - 6th Pacific Rim International Conference on Artificial Intelligence, Proceedings
EditorsRiichiro Mizoguchi, John Slaney
PublisherSpringer Verlag
Number of pages11
ISBN (Electronic)9783540445333
ISBN (Print)3540679251, 9783540679257
Publication statusPublished - 2000
Externally publishedYes
Event6th Pacific Rim International Conference on Artificial Intelligence - Melbourne, Australia
Duration: 28 Aug 20001 Sep 2000
Conference number: 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1886 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th Pacific Rim International Conference on Artificial Intelligence
Abbreviated titlePRICAI 2000


Dive into the research topics of 'Argumentation Semantics for Defeasible Logics'. Together they form a unique fingerprint.

Cite this