The Inference Problem for Template Dependencies
Summary: Template dependencies: integrity constraints stipulating that whenever tuples agree on certain attributes an additional agreeing tuple must exist. Proves implication/inference for template dependencies undecidable (no algorithm for logical consequence from a finite set), holds under both finite and unrestricted database semantics. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuri Gurevich
- 2. Harry R. Lewis
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,032 | The Implication And Finite Implication Problems For Typed Template Dependencies | 1982 | PODS | 9.7332616e-05 |
| 3,643 | The Complexity of Data Exchange | 2006 | PODS | 6.8862411e-05 |
| 6,033 | Embedded Join Dependencies As A Tool For Decomposing Full Join Dependencies | 1985 | PODS | 5.2415551e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,032 | The Implication And Finite Implication Problems For Typed Template Dependencies | 1982 | PODS | 9.7332616e-05 |
Previous
Page 1 / 1
Next