Database Paper Browser

Back to papers

Safety and Correct Translation of Relational Calculus Formulas

Summary: Simplifies definitions and proofs for the evaluable and allowed decidable subclasses of domain-independent relational calculus, with treatment of equality. Introduces a relational-algebra normal form and Dom-free transforms evaluable→allowed→RANF for correct translations, arguing evaluable may be the largest efficiently recognizable decidable subclass. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
806
Venue
PODS
Year
1987
Pagerank
7.334684e-05
Overall Rank
3,238 | 77.48%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

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

Semantically Similar Papers