Database Paper Browser

Back to papers

Fixed-point semantics and the representation of algorithms on large data

Summary: Two fixed-point semantics for logic programs with data: standard semantics yields P false; data-relative inductive semantics yields P true. Demonstrates encoding of algorithms, e.g., Dijkstra's shortest path, as inductive definitions under an operational semantics. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7857
Venue
VLDB
Year
1988
Pagerank
4.1945683e-05
Overall Rank
12,969 | 9.78%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
77 An Amateur's Introduction to Recursive Query Processing Strategies 1986 SIGMOD 0.00057043861
1,008 The BANG file: a new kind of grid file 1987 SIGMOD 0.00014666726
Previous Page 1 / 1 Next

Semantically Similar Papers