DBScholar

Back to papers

Inference Rules for Functional and Inclusion Dependencies

Summary: Provides a sound and complete set of inference rules for the combined implication problem of functional and inclusion dependencies (entailment over all finite and infinite databases). The rules deliberately violate the “natural” axiomatization conditions of [5], thereby circumventing prior negative results. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
645
Venue
PODS
Year
1983
Pagerank
7.3938918e-05
Overall Rank
3,461 | 76.26%
DOI
10.1145/588058.588067

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{mitchell_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{Inference Rules for Functional and Inclusion Dependencies}},
        url = {https://dl.acm.org/doi/10.1145/588058.588067},
        doi = {10.1145/588058.588067},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Mitchell, John C.},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,159 Relational Transducers for Electronic Commerce 1998 PODS 0.00011898742
3,443 LAURA: A Formal Data Model and Her Logical Design Methodology 1983 VLDB 7.4116889e-05
4,094 Formal Limits on the Automatic Generation and Maintenance of Integrity Constraints 1987 PODS 6.906603e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers