Differential constraints

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2005, Pages 348-357

  Sayrafi, Bassem ^a   Van Gucht, Dirk ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONSTRAINT THEORY; SET THEORY;

BOOLEAN DEPENDENCIES; DIFFERENTIAL CONSTRAINTS; POWERSET;

FINITE DIFFERENCE METHOD;

EID: 33244486342     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065213     Document Type: Conference Paper

References (28)

1. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Database Systems. Addison-Wesley, Reading, Mass., 1995.
2. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-499, 1994.
3. Marcelo Arenas and Leonid Libkin. A normal form for xml documents. In Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 85-96. ACM Press, 2002.
4. Jaume Baixeries. A formal concept analysis framework to mine functional dependencies. Workshop on mathematical mehtods for learning, Villa Geno, Como, Italy, 2004.
5. Jaume Baixeries and Jos Lus Balcázar. Characterization and armstrong relations for degenerate multivalued dependencies using formal concept analysis. In Proceedings of third international conference on formal concept analysis, LNCS. To appear Springer-Verlag, 2005.
6. Artur Bykowski and Christophe Rigotti. A condensed representation to find frequent patterns. In Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 267-273. ACM Press, 2001.
7. Toon Calders. Computational complexity of itemset frequency satisfiability. In Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 143-154, 2004.
8. Toon Calders and Bart Goethals. Mining all non-derivable frequent itemsets. In Proceedings European Conference on Principles of Data Mining and Knowledge Discovery, volume 2431 of LNCS, pages 74-85. Springer-Verlag, 2002.
9. Toon Calders and Jan Paredaens. Axiomatization of frequent sets. In Proceedings of the international conference on database theory, pages 204-218, 2001.
10. Mehmet M. Dalkilic and Edward L. Robertson. Information dependencies. In Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 245-253. ACM Press, 2000.
11. János Demetrovics, Leonid Libkin, and Ilya B. Muchnik. Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics, 40(2):155-185, 1992.
12. Ronald Fagin. Functional dependencies in a relational data base and prepositional logic. IBM Journal of Research and Development, 21(6):543-544, 1977.
13. George A. Grätzer. General Lattice Theory. Birkhäuser-Verlag, 2nd edition, 1998. XIX + 663 pages.
14. Joseph Y. Halpern. Reasoning about Uncertainty. The MIT Press, 2003.
15. Sven Hartmann and Sebastian Link. Multi-valued dependencies in the presence of lists. In Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 330-341, 2004.
16. Paris C. Kanellakis. Elements of relational database theory. Handbook of theoretical computer science (vol. B): formal models and semantics, pages 1073-1156, 1990.
17. Marzena Kryszkiewicz and Marcin Gajek. Concise representation of frequent patterns based on generalized disjunction-free generators. In Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pages 159-171. Springer-Verlag, 2002.
18. Tony T. Lee. An information-theoretic analysis of relational databases - part i: Data dependencies and information metric. IEEE Transactions on Software Engineering, SE-13:1049-1061, 1987.
19. Francesco M. Malvestuto. Statistical treatment of the information content of a database. Information Systems, 11:211-223, 1986.
20. Heikki Mannila and Hannu Toivonen. Multiple uses of frequent sets and condensed representations (extended abstract). In Knowledge Discovery and Data Mining, pages 189-194, 1996.
21. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
22. Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., and Ronald Fagin. An equivalence between relational database dependencies and a fragment of prepositional logic. J. ACM, 28(3):435-453, 1981.
23. Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., and Ronald Fagin. Correction to "an equivalence between relational database dependencies and a fragment of prepositional logic". J. ACM, 34(4):1016-1018, 1987.
24. Bassem Sayrafi and Dirk Van Gucht. Inference systems derived from additive measures. Workshop on Causality and Causal Discovery, London, Canada, 2004.
25. Bassem Sayrafi, Dirk Van Gucht, and Marc Gyssens. Measures in databases and datamining. Tech. Report TR602, Indiana University Computer Science, 2004.
26. Bassem Sayrafi, Dirk Van Gucht, and Marc Gyssens. The implication problem for measure constraints. Submitted, 2005.
27. Claude E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379-423 and 623-656, July and October 1948.
28. E. H. Simpson. Measurement of diversity. In Nature, volume 163, page 688, 1949.