Relating defeasible and normal logic programming through transformation properties
✍ Scribed by Carlos Iván Chesñevar; Jürgen Dix; Frieder Stolzenburg; G.R.Guillermo Ricardo Simari
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 322 KB
- Volume
- 290
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEMDeLP to classical logic programming frameworks. In DeLP, we distinguish between two di erent sorts of rules: strict and defeasible rules. Negative literals (∼ A) in these rules are considered to represent classical negation. In contrast to this, in normal logic programming (NLP), there is only one kind of rules, but the meaning of negative literals (not A) is di erent: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been deÿned for NLP, notably the well-founded semantics (WFS) (van Gelder et al.,