Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model

@inproceedings{Przymusinski1989EveryLP,
  title={Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model},
  author={Teodor C. Przymusinski},
  booktitle={PODS},
  year={1989}
}
The perfect model semantics [Apt et al., 1987; Gelder, 1987; Przymusinski, 1987; Przymusinski, 1988c) provides an attractive alternative to the traditionally used semantics of logic programs based on Clark’s completion of the program [Clark, 1978; Lloyd, 1984; ‘Fitting, 1985; Kunen, 19871. Perfect models are minimal models of the program, which can be equivalently described as iterated least fixed points of natural operators [Apt et al., 1987; Gelder, 19871, as iterated least models of the… CONTINUE READING
Highly Influential
This paper has highly influenced 28 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 161 extracted citations

The Limits of Fixed-Order Computation

View 17 Excerpts
Highly Influenced

The distribution semantics for normal programs with function symbols

Int. J. Approx. Reasoning • 2016
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.

Negation az failme uzing tight derivations for general logic programs

A. Van Gelder
[Gelder, • 1987
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…