DBScholar

Back to papers

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

Summary: Distinguishes logic-program fixed points that conflate data and definitions from inductive-definition semantics interpreting definitions relative to data, yielding different truth values. Uses this distinction to encode Dijkstra’s shortest-path algorithm as an inductive definition with operational semantics. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8048
Venue
VLDB
Year
1988
Pagerank
5.093636e-05
Overall Rank
13,166 | 9.67%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{rougemont_vldb88,
        title = {{Fixed-point semantics and the representation of algorithms on large data}},
        author = {de Rougemont, Michel},
        journal = {PVLDB},
        series = {{VLDB} '88},
        pages = {264},
        year = {1988}
}

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
63 An Amateur's Introduction to Recursive Query Processing Strategies 1986 SIGMOD 0.00038782376
1,032 The BANG file: a new kind of grid file 1987 SIGMOD 0.00012530965
Previous Page 1 / 1 Next

Semantically Similar Papers