SLFD Logic: Elimination of Data Redundancy in Knowledge Representation

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 SLFD for functional dependencies that will allows us the design of automatic transformations of data models to remove redundancy.

[1]  Valeria De Antonellis,et al.  Relational Database Theory , 1993 .

[2]  David L. Robertson,et al.  Software Blueprints: Lightweight Uses of Logic in Conceptual Modelling , 1999 .

[3]  Yishai A. Feldman,et al.  Portability by automatic translation a large-scale case study , 1995, Proceedings 1995 10th Knowledge-Based Software Engineering Conference.

[4]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[5]  Russell Greiner,et al.  Finding Optimal Derivation Strategies in Redundant Knowledge Bases , 1991, Artif. Intell..

[6]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[7]  Ronald Fagin,et al.  Functional Dependencies in a Relational Data Base and Propositional Logic , 1977, IBM J. Res. Dev..

[8]  Yishai A. Feldman,et al.  Portability by automatic translation: a large-scale case study , 1999 .

[9]  Angel Mora,et al.  FD3: A Functional Dependencies Data Dictionary , 2002, ICEIS.

[10]  Elżbieta Hajnicz.  Time Structures: Formal Description and Algorithmic Representation , 1996 .

[11]  P. H. Baucom,et al.  Software Blueprints , 1978, ACM Annual Conference.

[12]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[13]  Leopoldo E. Bertossi,et al.  SCDBR: A Reasoner for Specifications in the Situation Calculus of Database Updates , 1994, ICTL.

[14]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[15]  Elisa Bertino,et al.  Intelligent Database Systems , 2000 .

[16]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[17]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[18]  David A. Bell,et al.  From Data Properties to Evidence , 1993, IEEE Trans. Knowl. Data Eng..

[19]  Toshihide Ibaraki,et al.  Functional Dependencies in Horn Theories , 1999, Artif. Intell..

[20]  David A. Bell,et al.  Computational methods for rough classification and discovery , 1998, KDD 1998.

[21]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[22]  E. F. Codd,et al.  The Relational Model for Database Management, Version 2 , 1990 .

[23]  Marc Gyssens,et al.  The Structure of the Relational Database Model , 1989, EATCS Monographs on Theoretical Computer Science.

[24]  Alexander Tuzhilin,et al.  Templar: a knowledge-based language for software specifications using temporal logic , 1991, TOIS.