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 language | English |
---|---|
Title of host publication | Automata, Languages and Programming - 8th Colloquium |
Editors | Shimon Even, Oded Kariv |
Publisher | Springer Verlag |
Pages | 73-85 |
Number of pages | 13 |
ISBN (Print) | 9783540108436 |
DOIs | |
State | Published - 1981 |
Event | 8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel Duration: 13 Jul 1981 → 17 Jul 1981 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 115 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 8th International Colloquium on Automata, Languages and Programming, ICALP 1981 |
---|---|
Country/Territory | Israel |
City | Acre |
Period | 13/07/81 → 17/07/81 |
Bibliographical note
Publisher Copyright:© 1981, Springer-Verlag.