The Alternating Fixpoint of Logic Programs with Negation

Front Cover
University of California, Santa Cruz, Computer Research Laboratory, 1989 - Horn clauses - 24 pages
Abstract: "We introduce and describe the alternating fixpoint of a logic program with negation. The underlying idea is to monotonically 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, we can derive the positive conclusions that follow (without deriving further any negative ones), by traditional Horn clause semantics. The union of positive and negative conclusins is called the alternating fixpoint 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.

From inside the book

Common terms and phrases

Bibliographic information