• Citer

Constraint-generating dependencies

par Baudinet, Marianne ;Chomicki, Jan;Wolper, Pierre
Référence Lecture notes in computer science, 874, page (205-217)
Publication Publié, 1994

Article révisé par les pairs

• Détails
• Contenu

Résumé :

Traditionally, dependency theory has been developed for uninterpreted data. Specifically, the only assumption that is made about the data domains is that data. values can be compared for equality. However, data is often interpreted and there can be advantages in considering it as such, for instance obtaining more compact representations as done in constraint databases. This paper considers dependency theory in the context of interpreted data. Specifically, it studies constraint-generating dependencies. These are a generalization of equality-generating dependencies where equality requirements are replaced by constraints on an interpreted domain. The main technical results in the paper are decision procedures for the implication and consistency problems for constraintgenerating dependencies. These decision procedures proceed by reducing the dependency problem to a decision problem for the constraint theory of interest, and are applicable as soon as the underlying constraint theory is decidable. Furthermore, complexity results for specific constraint domains can be transferred quite directly to the dependency problem.