SLFD Logic: Elimination of Data Redundancy in Knowledge Representation
Conference paper
First Online:
Abstract
In this paper, we propose the use of formal techniques on Software Engineering in two directions: 1)We present, within the general framework of lattice theory, the analysis of relational databases. To do that, we characterize the concept of f-family (Armstrong relations) by means of a new concept which we call non-deterministic ideal operator. This characterization allows us to formalize database redundancy in a more significant way than it was thought of in the literature. 2) We introduce the Substitution Logic SL FD for functional dependencies that will allows us the design of automatic transformations of data models to remove redundancy.
Keywords
Relational Database Functional Dependency Knowledge Representation Closure Operator Axiomatic System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.William W. Armstrong. Dependency structures of data base relationships. Proc. IFIP Congress. North Holland, Amsterdam, pages 580–583, 1974.Google Scholar
- 2.Paolo Atzeni and Valeria De Antonellis. Relational Database Theory. The Benjamin/Cummings Publishing Company Inc., 1993.Google Scholar
- 3.D.A. Bell. From data properties to evidence. IEEE Transactions on Knowledge andData Engireering, 5(6):965–968, 1993.CrossRefGoogle Scholar
- 4.D.A. Bell and J.W. Guan. Computational methods for rought classifications and discovery. J. American Society for Information Sciences, To appear. Special issue on Data Mining.Google Scholar
- 5.Elisa Bertino, Barbara Catania, and Gian Piero Zarri. Intelligent Database Systems. ACM Press. Addison-Wesley, ISBN 0-201-87736-8, 2001.Google Scholar
- 6.L. E. Bertossi and J. C. Ferretti. SCDBR: A reasoner for specification in the situation calculus of database updates. In 1st International Conference on Temporal Logic, Berlin, 1994.Google Scholar
- 7.Edgar F. Codd. The relational model for database management: Version 2. reading, mass. Addison Wesley, 1990.Google Scholar
- 8.Manuel Enciso and Angel Mora. FD3: A functional dependencies data dictionary. Proceedings of the Fourth Conference on Enterprise Information Systems (ICEIS). Ciudad Real, Spain, 2:807–811, 2002 Apr.Google Scholar
- 9.Ronald Fagin. Functional dependencies in a relational database and propositional logic. IBM. Journal of research andd evelopment., 21 (6):534–544, 1977.zbMATHMathSciNetGoogle Scholar
- 10.Yishai A. Feldman and Doron A. Friedman. Portability by automatic translation: A large-scale case study. Artificial Intelligence, 107(1):1–28, 1999.zbMATHCrossRefGoogle Scholar
- 11.Rusell Greiner. Finding optimal derivation strategies in redundant knowledge bases. Artificial Intelligence, 50(1):95–115, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
- 12.J. W. Guan and D. A. Bell. Roughcomputational methods for information systems. Artificial Intelligence, 105:77–103, 1998.zbMATHCrossRefGoogle Scholar
- 13.J.W. Guan and D.A. Bell. Roughcomputational methods for information systems. Artificial Intelligence, 105:77–103, 1998.zbMATHCrossRefGoogle Scholar
- 14.Erika Hajnicz. Time structures. formal description and algorithmic representation. In Lecture Notes in Artificial Intelligence. Num. 1047. Springer-Verlag, 1996.Google Scholar
- 15.Toshihide Ibaraki, Alexander. Kogan, and Kazuhisa Makino. Functional dependencies in horn theories. Artificial Intelligence, 108:1–30, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
- 16.Zohar Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer-Verlag, 1995.Google Scholar
- 17.Jan Paredaens, Paul De Bra, Marc Gyssens, and Dirk Van Van Gucht. The structure of the relational database model. EATCS Monographs on Theoretical Computer Science, 1989.Google Scholar
- 18.Z. Pawlak. Rough Set: teoretical aspects of reasoning about data. Kluwer, 1991. Dordrecht, Netherlands.Google Scholar
- 19.David Robertson and Jaum Agustí. Lightweight uses of logic in conceptual modelling. Software Blueprints. ACM Press. Ed. Addison Wesley, 1999.Google Scholar
- 20.Alexander Tuzhilin. Templar: a knowledge-based language for software specifications using temporal logic. ACM Transactions on Information Systems, 13:269–304, July 1995.Google Scholar
- 21.Jeffrey D. Ullman. Database and knowledge-base systems. Computer Science Press, 1988.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2002