Embedding Defeasible Logic into Logic Programs

Grigoris Antoniou, Michael J. Maher

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

10 Citations (Scopus)


Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of extended logic programs. In particular, we give a translation of a defeasible theory D into a program P(D).We showtha t under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

Original languageEnglish
Title of host publicationLogic Programming
Subtitle of host publication18th International Conference, ICLP 2002 Copenhagen, Denmark, July 29 – August 1, 2002 Proceedings
EditorsPeter J. Stuckey
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783540456193
ISBN (Print)3540439307, 9783540439301
Publication statusPublished - 17 Jul 2002
Externally publishedYes
Event18th International Conference on Logic Programming - Copenhagen, Denmark
Duration: 29 Jul 20021 Aug 2002
Conference number: 18

Publication series

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


Conference18th International Conference on Logic Programming
Abbreviated titleICLP 2002


Dive into the research topics of 'Embedding Defeasible Logic into Logic Programs'. Together they form a unique fingerprint.

Cite this