Issue No. 01 - January (1989 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.21726
<p>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.</p>
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.
C. Yang, "Deduction Graphs: An Algorithm and Applications," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 60-67, 1989.