The implication and finite implication problems for typed template dependencies

Authors:
Moshe Y. Vardi
Affiliations:
Stanford University, Stanford, California
Venue:
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Year:
1982

Citing 10
Cited 5

Extending the database relational model to capture more meaning

ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies

ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies

ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks

Communications of the ACM
The inference problem for template dependencies

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The Implication Problem for Data Dependencies

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Embedded implicational dependencies and their inference problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A complete axiomatization for a large class of dependencies in relational datatbases

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Horn clauses and database dependencies (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Horn clauses and database dependencies

Journal of the ACM (JACM)
The inference problem for template dependencies

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
On the decidability and finite controllability of query processing in databases with incomplete information

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the finite controllability of conjunctive query answering in databases under open-world assumption

Journal of Computer and System Sciences
Database theory, Yuri, and me

Fields of logic and computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

The class of typed template dependencies is a class of data dependencies that includes embedded multivalued and join dependencies. We show that the implication and the finite implication problems for this class are unsolvable. An immediate corollary is that this class has no formal system for finite implication. We also show how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.The class of simple template dependencies is a proper subclass of the above class, and it generalizes slightly embedded join dependencies. It is shown that the implication and the finite implication problems for this class are also unsolvable. An immediate corollary is that this class has no formal system for either implication or finite implication.