DMCA
An Alternative Characterization of Disjunctive Logic Programs (1991)
| Venue: | LOGIC PROGRAMMING: PROC. OF THE 1991 INT'L SYMP |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Reed91analternative,
author = {David W. Reed and Donald W. Loveland and Bruce T. Smith},
title = {An Alternative Characterization of Disjunctive Logic Programs},
booktitle = {LOGIC PROGRAMMING: PROC. OF THE 1991 INT'L SYMP},
year = {1991},
pages = {54--68},
publisher = {MIT Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present an alternative characterization of disjunctive logic programs. We first review Inheritance near-Horn Prolog (InH-Prolog), an intuitive and computationally effective procedure that extends Prolog using case-analysis. We then describe a fixpoint characterization of disjunctive logic programs that is similarly based on case-analysis. This fixpoint characterization closely corresponds to the InH-Prolog procedure, and so gives needed insight into the difficult problem of recognizing the minimal disjunctive answers obtainable from the procedure. Due to its case-analysis nature, this characterization maintains a natural and close relationship to the standard characterization of Horn programs. It also gives added insight into the role of definite answers for disjunctive programs and enables one to neatly focus attention on the interesting class of definite (single atom) consequences.
Keyphrases
disjunctive logic program alternative characterization fixpoint characterization case-analysis nature close relationship minimal disjunctive answer needed insight added insight effective procedure single atom definite answer disjunctive program inheritance near-horn prolog inh-prolog procedure standard characterization interesting class horn program difficult problem
