Subscribe

Issue No.07 - July (2008 vol.20)

pp: 965-975

ABSTRACT

Various graphic techniques have been developed to analyze structural errors in rule-based systems that utilize inference (propositional) logic rules. Four typical errors in rule-based systems are: redundancy (numerous rule sets resulting in the same conclusion); circularity (a rule leading back to itself); incompleteness (deadends or a rule set conclusion leading to unreachable goals); and inconsistency (rules conflicting with each other). This study presents a new DNA-based computing algorithm mainly based upon Adleman's DNA operations. It can be used to detect such errors. There are three phases to this molecular solution: rule-to-DNA transformation design, solution space generation, and rule verification. We first encode individual rules using relatively short DNA strands, and then generate all possible rule paths by the directed joining of such short strands to form longer strands. We then conduct the verification algorithm to detect errors. The potential of applying this proposed DNA computation algorithm to rule verification is promising given the operational time complexity of O(n*q), in which n denotes the number of fact clauses in the rule base and q is the number of rules with longest inference chain.

INDEX TERMS

Rule-based processing, Knowledge base verification, Evolutionary computing and genetic algorithms

CITATION

Chung-Wei Yeh, "Molecular Verification of Rule-Based Systems Based on DNA Computation",

*IEEE Transactions on Knowledge & Data Engineering*, vol.20, no. 7, pp. 965-975, July 2008, doi:10.1109/TKDE.2007.190743REFERENCES

- [4] G. Valiente, “Verification of Knowledge Based Redundancy and Subsumption Using Graph Transformations,”
Int'l J. Expert Systems, vol. 6, no. 3, pp. 341-355, 1993.- [10] M. Amos,
Theoretical and Experimental DNA Computation. Springer, 2004.- [11] R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, and L.M. Adleman, “Solution of a Satisfiability Problem on a Gel-Based DNA Computer,”
Proc. Sixth Int'l Workshop DNA-Based Computers: DNA Computing, 1999.- [12] G. Paun, G. Rozenberg, and A. Salomaa,
DNA Computing: New Computing Paradigms. Springer-Verlag, 1998.- [13] R.P. Feynman and D. Gilbert, “There's Plenty of Room at the Bottom,”
Eng. and Science Magazine, vol. 23, no. 5, 1960.- [14] Q. Liu, Z. Guo, A.E. Condon, R.M. Corn, M.G. Lagally, and L.M. Smith, “A Surface-Based Approach to DNA Computation,”
Proc. Second Ann. DIMACS Workshop DNA-Based Computers, 1996.- [16] S. Roweis, E. Winfree, R. Burgoyne, N.V. Chelyapov, M.F. Goodman, P.W.K. Rothemund, and L.M. Adleman, “A Sticker-Based Model for DNA Computing,”
J. Computational Biology, vol. 5, no. 4, pp. 615-629, 1998.- [17] R.J. Lipton, “DNA Solution of Hard Computational Problems,”
Science, vol. 268, pp. 542-545, 1995.- [18] T.A. Nguyen, W.A. Perkins, T.J. Laffey, and D. Pecora, “Knowledge Base Verification,”
AI Magazine, vol. 8, no. 2, pp. 69-75, 1987. |