1990•Unpublished venueOpen access

The expressive powers of the logic programming semantics (extended abstract)

John S. Schlipf

Abstract

We compare the expressive powers of three semantics for deductive databases and logic programming: the 3-valued program completion semantics, the well-founded semantics, and the stable semantics, We identify the expressive power of the stable semantics, and in fairly general circumstances that of the well-founded semantics.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 42 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Well-founded semantics, Programming language, Semantics (computer science), Computer science, Operational semantics, Axiomatic semantics, Denotational semantics, Logic programming