The implication and finite implication problems for typed template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
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
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Notions of dependency satisfaction
Journal of the ACM (JACM) - The MIT Press scientific computation series
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
The implication and finite implication problems for typed template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The complexity of data exchange
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Verification of knowledge bases based on containment checking
Artificial Intelligence
Verification of knowledge bases based on containment checking
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Fields of logic and computation
| Hi-index | 0.00 |
A template dependency is a formalized integrity constraint on a relational database, stating that whenever tuples exist in the database that agree on certain attributes, an additional tuple must also be present that agrees with the others in a specified way. It is here shown that the inference problem for template dependencies is undecidable, that is, there can be no algorithm for determining whether a given dependency is a logical consequence of a given finite set of dependencies. The undecidability result holds whether or not databases are considered to be necessarily finite.