A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
On the undecidability of implications between embedded multivalued database dependencies
Information and Computation
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Null inclusion dependencies in relational databases
Information and Computation
A Complete Axiomatization of Full Join Dependencies
Journal of the ACM (JACM)
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Proceedings of the Eighth International Conference on Data Engineering
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Constraint-Generating Dependencies
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Sound and Complete Forward and backward Chainingd of Graph Rules
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Piece Resolution: Towards Larger Perspectives
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
The additivity Problem for Data Dependencies in Incomplete Relational Databases
Selected Papers from a Workshop on Semantics in Databases
Discovery of multivalued dependencies from relations
Discovery of multivalued dependencies from relations
| Hi-index | 0.00 |
Data dependencies are well known in the context of relational database. They aim to specify constraints that the data must satisfy to model correctly the part of the world under consideration. The implication problem for dependencies is to decide whether a given dependency is logically implied by a given set of dependencies. A proof procedure for the implication problem called "chase", has already been studied in the generalized case of tuple-generating and equality-generating dependencies. The chase is a bottom-up procedure: from hypotheses to conclusion, and thus is not goal-directed. It also requires the dynamic creation of new symbols. This paper introduces a new proof procedure which is top-down: from conclusion to hypothesis, that is goal-directed. The originality of this procedure is that it does not act as classical theorem proving procedures, by requiring a special form of expresions, such as clausal form, obtained after skolemisation. We show, with out procedure, that this step is useless, and that the notion of piece allows inferring directly on dependencies, without dynamically creating new symbols. With the recent introduction of constrained dependencies, some interesting perspectives also arise.