A Proof System for Dependencies for Information Relations

Authors:
Wendy Maccaull
Affiliations:
(Correspd.) (Supported by the Natural Sciences and Engineering Research Council of Canada and by the St. Francis Xavier University Council for Research) Department of Mathematics, Statistics and C ...
Venue:
Fundamenta Informaticae
Year:
2000

Citing 9
Cited 0

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Exploring logical dynamics

Exploring logical dynamics
Relational formalisation of nonclassical logics

Relational methods in computer science
Databases

Relational methods in computer science
A new framework for itemset generation

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Tableaux for Functional Dependencies and Independencies

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a relational approach, we investigate the implication problem for dependencies for information relations, focusing on functional dependencies, association rules and multivalued dependencies. We develop a Rasiowa/Sikorski-style relational calculus and show that the associated tableaux style of reasoning gives a decidable procedure for each of the three kinds of inference problems under consideration. This work has applications to classical database theory and to Rough Set Theory. The techniques may be generalized to the many other data dependencies which have formulations via binary relations and they can be applied to other information relations which arise in the study of incomplete information.