Categories and Subject Descriptors: H.2.1 [Database Management]: Logical Design -- normal forms; I.2.3 [Artificial Intelligence]: Deduction and Theorem Proving -- resolution
General Terms: Algorithms, Theory
Additional Key Words and Phrases: Armstrong database, database dependency, lossless join decomposition
Selected papers that cite this one
- Ronald Fagin. Horn clauses and database dependencies. Journal of the ACM, 29(4):952-985, October 1982.
Selected references
- Ronald Fagin. Horn clauses and database dependencies. Journal of the ACM, 29(4):952-985, October 1982.
- L. Henschen and L. Wos. Unit refutations and Horn sets. Journal of the ACM, 21(4):590-605, October 1974.
- Fereidoon Sadri and Jeffrey D. Ullman. A complete axiomatization for a large class of dependencies in relational databases. In Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pages 117-122, Los Angeles, California, 28-30 April 1980.