DMCA
The Alternating Fixpoint of Logic Programs with Negation (1995)
Cached
Download Links
| Citations: | 244 - 3 self |
BibTeX
@MISC{Gelder95thealternating,
author = {Allen Van Gelder},
title = { The Alternating Fixpoint of Logic Programs with Negation},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The alternating fixpoint of a logic program with negation is defined constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models. From a fixed set of negative conclusions, the positive conclusions follow (without deriving any further negative ones), by traditional Horn clause semantics. The union of positive and negative conclusions is called the alternating xpoint partial model. The name "alternating" was chosen because the transformation runs in two passes; the first pass transforms an underestimate of the set of negative conclusions into an (intermediate) overestimate; the second pass transforms the overestimate into a new underestimate; the composition of the two passes is monotonic. The principal contributions of this work are (1) that the alternating fixpoint partial model is identical to the well-founded partial model, and (2) that alternating xpoint logic is at least as expressive as xpoint logic on all structures. Also, on finite structures, fixpoint logic is as expressive as alternating fixpoint logic.
Keyphrases
negative conclusion logic program alternating fixpoint xpoint logic fixpoint logic principal contribution alternating xpoint partial model fixed set finite structure new underestimate negative one fixpoint partial model traditional horn clause semantics stable model first pas well-founded partial model underlying idea second pas positive conclusion
