Horn axiomatizations for sequential data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 1700387 (Why is no real title available?)
- scientific article; zbMATH DE number 61569 (Why is no real title available?)
- scientific article; zbMATH DE number 1354130 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 2168560 (Why is no real title available?)
- scientific article; zbMATH DE number 2101374 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- Database Theory - ICDT 2005
- Discovery Science
- Functional dependencies in relational databases: A lattice point of view
- Horn approximations of empirical data
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Model theory.
- SPADE: An efficient algorithm for mining frequent sequences
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
Cited in
(3)
This page was built for publication: Horn axiomatizations for sequential data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870272)