## The expressive powers of logic programming semantics (1995)

Venue: | Abstract in Proc. PODS 90 |

Citations: | 85 - 5 self |

### BibTeX

@INPROCEEDINGS{Schlipf95theexpressive,

author = {John S. Schlipf},

title = {The expressive powers of logic programming semantics},

booktitle = {Abstract in Proc. PODS 90},

year = {1995},

pages = {196--204}

}

### Years of Citing Articles

### OpenURL

### Abstract

We study the expressive powers of two semantics for deductive databases and logic programming: the well-founded semantics and the stable semantics. We compare them especially to two older semantics, the two-valued and three-valued program completion semantics. We identify the expressive power of the stable semantics, and in fairly general circumstances that of the well-founded semantics. In particular, over infinite Herbrand universes, the four semantics all have the same expressive power. We discuss a feature of certain logic programming semantics, which we call the Principle of Stratification, a feature allowing a program to be built easily in modules. The three-valued program completion and well-founded semantics satisfy this principle. Over infinite Herbrand models, we consider a notion of translatability between the three-valued program completion and well-founded semantics which is in a sense uniform in the strata. In this sense of uniform translatability we show the well-founded semantics to be more expressive than the three-valued program completion. The proof is a corollary of our result that over non-Herbrand infinite models, the well-founded semantics is more expressive than the three-valued program completion semantics. 1