This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deduction Graphs: An Algorithm and Applications
January 1989 (vol. 15 no. 1)
pp. 60-67

A deduction graph (DG) for logically deducing a new functional dependency (FD) or function-free Horn formula (extended from Horn clauses) from a subset of a given FDs or function-free headed Horn clauses in a relational database or rule-based expert systemsis defined. An algorithm with a polynomial time complexity for constructing a DG based on a number of rules is designed. Applications of DGs to relational databases, rule-based expert systems, logic programming, and artificial intelligence are investigated. In addition to graphically solving the inference problem by DGs, many logic queries can be answered by DGs with substitutions for unifying expressions.

[1] G. Ausielloet al., "Graph algorithms for functional dependency manipulation,"J. ACM, vol. 30. no. 4. pp. 752-766, Oct. 1983.
[2] C. Beeri and P. A. Bernstein, "Computational problems related to the design of normal form relational schemas,"ACM Trans. Data-base Syst., vol. 4, pp. 30-59, Mar. 1979.
[3] P. A. Bernstein, "Synthesizing third normal form relations from functional dependencies,"ACM Trans. Database Syst., vol. 1, no. 4, pp. 277-298, Dec. 1976.
[4] C. L. Chang and R. C. T. Lee,Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1973.
[5] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377-387, June 1970.
[6] C. J. Date,An Introduction to Database Systems, vols. 1 and 2. Reading, MA: Addison-Wesley, vol. 1, 1981, vol. 2, 1983.
[7] R. Fagin, "Normal form and relational database operators," inProc. ACM SIGMOD Conf., 1979, pp. 153-160.
[8] R. Fagin, "Horn clauses and database dependencies,"J. ACM, vol. 29, no. 3, pp. 952-985, Oct. 1982.
[9] F. Hayes-Roth, "Rule-based systems,"Commun. ACM, vol. 28, no. 9, pp. 921-932, Sept. 1985.
[10] T. W. Ling, F. W. Tompa, and T. Kameda, "An improved third normal form for relational databases,"ACM Trans. Database Syst., vol. 6, no 2, pp. 329-346, June 1981.
[11] J. W. Lloyd,Foundations of Logic Programming, New York: Springer, 1984.
[12] D. Maier, "Minimum covers in the relational database,"J. ACM, vol. 27, no. 4, pp. 664-674, Oct. 1980.
[13] J. Martin,Computer Data-Base Organization, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1977.
[14] Y. Sagivet al., "An equivalence between relational database dependencies and a fragment of propositional logic,"J. ACM, vol. 28, no. 3, pp. 435-453, July 1981.
[15] H. C. Smith, "Database design: Composing fully normalized tables from a rigorous dependency diagram,"Commun. ACM, vol. 28, no. 8, pp. 826-838, Aug. 1985.
[16] C. C. Yang,Relational Databases, Englewood Cliffs. NJ, Prentice-Halt, 1986.
[17] C. C. Yang, "A polynomial algorithm for logically deducing Horn clauses and processing logic queries," presented at the 3rd Annu. Computer Science Symp. Knowledge-Based Systems: Theory and Practice, Columbia, SC, Mar. 31-Apr. 1, 1986.
[18] C. Zaniolo, "A new normal form for the design of relational database scheme,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 489-499, Sept. 1982.

Index Terms:
deduction graph; functional dependency; function-free Horn formula; Horn clauses; relational database; rule-based expert systems; polynomial time complexity; logic programming; artificial intelligence; inference problem; logic queries; database theory; expert systems; inference mechanisms; logic programming; relational databases.
Citation:
Chao-Chih Yang, "Deduction Graphs: An Algorithm and Applications," IEEE Transactions on Software Engineering, vol. 15, no. 1, pp. 60-67, Jan. 1989, doi:10.1109/32.21726
Usage of this product signifies your acceptance of the Terms of Use.