Reduction of Abductive Logic Programs to Normal Logic Programs (1994)
| Venue: | Proc. 12th ICLP |
| Citations: | 14 - 6 self |
BibTeX
@INPROCEEDINGS{Toni94reductionof,
author = {Francesca Toni and Robert A. Kowalski},
title = {Reduction of Abductive Logic Programs to Normal Logic Programs},
booktitle = {Proc. 12th ICLP},
year = {1994},
pages = {367--381},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study a form of abductive logic programming which combines default and non-default abducibles and employs retractibles in integrity constraints. We also present a transformation from abductive to normal logic programs, which is correct and complete with respect to many semantics. These are all the semantics that can be formulated in an argumentation framework. A simplified form of the event calculus is used as an illustration. 1 Introduction Abductive logic programming (ALP) is the extension of normal logic programming (NLP) to incorporate abducibles and integrity constraints. Abducibles are atoms (or more generally literals) that represent incomplete information which can be added to programs, provided their addition does not violate the integrity constraints. Various forms of ALP have been presented in the literature (see [8] for a survey). In this paper we present a form of ALP based on those proposed by Eshghi and Kowalski [5, 6] and Kakas and Mancarella [9]. We a...
