Foundations of logic programming
Foundations of logic programming
Database design: composing fully normalized tables from a rigorous dependency diagram
Communications of the ACM
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Communications of the ACM
Relational databases
An improved third normal form for relational databases
ACM Transactions on Database Systems (TODS)
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme
IEEE Transactions on Software Engineering
Algorithms for Constructing Minimal Deduction Graphs
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
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.