Database Paper Browser

Back to papers

The Expressive Powers of the Logic Programming Semantics

Summary: Compares expressive power of 3-valued program completion, well-founded, and stable semantics for deductive databases, pinning down the exact power of the stable semantics and, under broad conditions, that of the well-founded semantics. Over infinite Herbrand models proves equivalence of the three semantics but, via a notion of uniform translatability, shows the well-founded semantics is strictly more expressive than 3-valued completion. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
901
Venue
PODS
Year
1990
Pagerank
4.613363e-05
Overall Rank
7,977 | 44.51%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,833 Adding Disjunction to Datalog (Extended Abstract) 1994 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers