Database Paper Browser

Back to papers

The Implication And Finite Implication Problems For Typed Template Dependencies

Summary: Establishes undecidability of implication and finite implication for typed template dependencies (generalizing embedded MVDs and JDs), implying no formal axiomatization. Extends to simple template dependencies and exhibits a finite set with unsolvable implication. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
632
Venue
PODS
Year
1982
Pagerank
9.7332616e-05
Overall Rank
2,032 | 85.87%
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 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
8 Extending the Data Base Relational Model to Capture More Meaning 1979 SIGMOD 0.0015385917
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
3,390 The Inference Problem for Template Dependencies 1982 PODS 7.1559646e-05
Previous Page 1 / 1 Next

Semantically Similar Papers