Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

TABLEAUX 1997: Automated Reasoning with Analytic Tableaux and Related Methods pp 358–372Cite as

Tableaux for functional dependencies and independencies

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1227))

Abstract

In this paper we show the application of prefixed-signed tableaux to functional dependencies and independencies. Although functional dependencies and independencies are first-order formulae, a custommade tableau proof procedure is more efficient than a general purpose tableau for first-order logic.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, T. Imielinski, and A. Swami. Database Mining: A Performance Perspective. IEEE Transactions on Knowledge and Data Engg., 5(6):914–925, December 1993.

    Google Scholar 

  2. Rakesh Agrawal and Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules. In Proc. of 20th VLDB Conference, pages 487–499, Santiago, Chile, 1994.

    Google Scholar 

  3. Rakesh Agrawal and Ramakrishnan Srikant. Mining Generalized Association Rules. In Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995.

    Google Scholar 

  4. W. W. Armstrong. Dependency Structure of Database Relationships. In Proc. IFIP 74, pages 580–583. North Holland, Amsterdam, 1974.

    Google Scholar 

  5. C. Beeri, P.A. Bernstein, and N. Goodman. A Sophisticate's Introduction to Database Normalisation Theory. Proc. of the Fourth Int'l. Conf. on Very Large Data Bases, pages 113–124, 1978.

    Google Scholar 

  6. Siegfired Bell. Discovery and Maintainence of Functional Dependencies. In Proc. of the First KDD Conference, pages 27–32, Montréal, Canada, 1995.

    Google Scholar 

  7. Dina Bitton, Heikki Mannila, and Kari-Jouko Räihä. Design-By-Example: A design Tool for Relational Databases. Technical Report TR 85–692, Dept of Computer Science, Cornell University, 1985.

    Google Scholar 

  8. Ramez A. Elmasri and Shamkant B. Navathe. Fundamentals of Database Systems. Benjamin Cummings, Redwood City, CA, 2nd edition, 1994.

    Google Scholar 

  9. Melvin Fitting. Proof Methods for Modal and Intuitionistic Logic. Riedel, Amsterdam, 1983.

    Google Scholar 

  10. Maurice Houtsma and Arun Swami. Set Oriented Mining for Association Rules. In Proc. of 11th Int'l Conf. on Data Engg. (ICDE), Taipei, Taiwan, 1995.

    Google Scholar 

  11. Tomasz Imielinski. From File Mining to Database Mining. In ACM-SIGMOD DMKD Workshop, Montréal, Canada, June 1996.

    Google Scholar 

  12. Mansfield Jaeger, Heikki Mannila, and Emil Weydert. Data Mining as Selective Theory Extraction in Probabilistic Logic. In ACM-SIGMOD DMKD Workshop, Montréal, Canada, June 1996.

    Google Scholar 

  13. J. M. Janas. Covers for Functional Independencies. In Conference on Database Theory, volume 338. Springer-Verlag, Lecture Notes in Computer Science, 1988.

    Google Scholar 

  14. Heikki Mannila, H Toivonen, and A. I. Verkamo. Discovering Frequent Eposides in Sequences. In Proc. of the First KDD Conference, pages 210–215, Montréal, Canada, 1995.

    Google Scholar 

  15. Sujal Parikh, M Ganesh, and Jaideep Srivastava. Parallel Data Mining for Functional Dependencies. Technical Report TR 96-033, Dept of Computer Science, University of Minnesota, 1996.

    Google Scholar 

  16. Bernhard Pfahringer and Stefan Kramer. Compression-Based Evaluation of Partial Determinations. In Proc. of the First KDD Conference, pages 234–239, Montréal, Canada, 1995.

    Google Scholar 

  17. B. Thalheim. Logical Relational Database Design Tool Using Different Classes of Dependencies. Journal of New Generation Computing Systems, 1(3):211–228, 1988.

    Google Scholar 

  18. Jeffrey D. Ullman. Database and Knowledge-Base Systems. Computer Science press, Rockville, Maryland, 1988.

    Google Scholar 

  19. Moshe Vardi. Fundamentals of Dependency Theory. pages 171–224. Computer Science Press, 1988.

    Google Scholar 

  20. Duminda Wijesekera, M. Ganesh, and Jaideep Srivastava. A Complete Axiomatization for Functional Independencies. Technical Report TR 96-066, Dept. of Computer Science, Univ. of Minnesota, Minneapolis, MN 55455, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of Minnesota, 55455, Minneapolis, MN

    Duminda Wijesekera, M. Ganesh & Jaideep Srivastava

  2. Dept. of Mathematics, Cornell University, 14853, Ithaca, NY

    Anil Nerode

Authors
  1. Duminda Wijesekera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Ganesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jaideep Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anil Nerode
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Galmiche

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wijesekera, D., Ganesh, M., Srivastava, J., Nerode, A. (1997). Tableaux for functional dependencies and independencies. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027426

Download citation

  • DOI: https://doi.org/10.1007/BFb0027426

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62920-7

  • Online ISBN: 978-3-540-69046-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation