The implication problem for data dependencies

C. Beeri, M. Y. Vardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

195 Scopus citations

Abstract

In this paper we study the implication and the finite implication problems for data dependencies. When all dependencies are total the problems are equivalent and solvable but are NP-hard, i.e., probably computationally intractable. For non-total dependencies the implication problem is unsolvable, and the finite implication problem is not even partially solvable. Thus, there can be no formal system for finite implication. The meta decision problems of deciding for a given class of dependencies whether the implication problem is solvable or whether implication is equivalent to finite implication are also unsolvable.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 8th Colloquium
EditorsShimon Even, Oded Kariv
PublisherSpringer Verlag
Pages73-85
Number of pages13
ISBN (Print)9783540108436
DOIs
StatePublished - 1981
Event8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel
Duration: 13 Jul 198117 Jul 1981

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume115 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Colloquium on Automata, Languages and Programming, ICALP 1981
Country/TerritoryIsrael
CityAcre
Period13/07/8117/07/81

Bibliographical note

Publisher Copyright:
© 1981, Springer-Verlag.

Fingerprint

Dive into the research topics of 'The implication problem for data dependencies'. Together they form a unique fingerprint.

Cite this