Abstract
In this paper, we will propose Horn clause computation as an underlying computational framework of DNA computer. Horn clause program is a subclass of the formulas of first order logic and has close relation to PROLOG language. The computational power of Horn clauses was discussed in (Tärnland, 1977) and it was shown that a finite set of Horn clauses is computationally equivalent to Turing Machine. Furthermore, it should be noted that Horn programs are adequate for representing nondeterministic computation. Thus, its parallel implementation with huge number of molecules might have possibility to overcome the computational power of conventional computers. It should also be noted that the clear logical semantics of Horn programs might enable us to accept it as a higher-level programming language of DNA computer. The aim of this paper is to propose an experimental method for implementing deduction with a subclass of Horn programs, called simple Horn programs. The computational power of this model is theoretically investigated and demonstrated with some applications to NP-complete problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.M. Adleman, “Molecular computation of solutions to combinatorial problems,” Science, vol. 266, pp. 1021–1024 1994.
L.M. Adleman, “On constructing a molecular computer,” inDNA Based Computers, Proc. of a DIMACSWorkshop, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, R.J. Lipton and E.B. Baum (Eds.), 1996, pp. 1–21.
M. Amos, A. Gibbons, and D. Hodgson, “Error-resistant implementation of DNA computations,” in Proc. of Second Annual Meeting on DNA Based Computers, E.B. Baum et al. (Eds.), 1996, pp. 87–101.
M. Arita, M. Hagiya, and A. Suyama, “Joining and rotating data with molecules,” in Proc. of IEEE International Conference on Evolutionary Computation, 1997, pp. 243–248.
D. Beaver, “A universal molecular computer,” in DNA Based Computers, in Proc. of a DIMACS Workshop, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, R.J. Lipton and E.B. Baum (Eds.), 1996, pp. 29–36.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.
M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, and S. Yokoyama, “Towards parallel evaluation and learning of Boolean μ-formulas with molecules,” in Proc. of the 3rd DIMACS Meeting on DNA Based Computers'97, 1997, pp. 105–114.
T. Head, “Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors,” Bulletin of Mathematical Biology, vol. 49, pp. 737–759, 1987.
S. Kobayashi, T. Yokomori, G. Sampei, and K. Mizobuchi, “DNA implementation of simple Horn clause computation,” in Proc. of IEEE International Conference on Evolutionary Computation, 1997, pp. 213–217.
R.J. Lipton, “Speeding up computations via molecular biology,” in DNA Based Computers, Proc. of a DIMACS Workshop, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, R.J. Lipton and E.B. Baum (Eds.), 1996, pp. 67–74.
J.W. Lloyd, Foundations of Logic Programming, Springer: Berlin, 1987.
V. Mihalache, “Prolog approach to DNA computing,” in Proc. of IEEE International Conference on Evolutionary Computation, 1997, pp. 249–254.
M. Ogihara and A. Ray, “Minimum DNA computation model and its computational power,” in Proc. of 1st Workshop on Unconventional Models of Computation, 1998, pp. 309–322.
Gh. Paun, “Regular extended H systems are computationally universal,” J. Inform. Process. Cybern., EIK, 1995.
J.H. Reif, “Parallel molecular computation: Models and simulations,” in Proc. of Seventh Annual ACMSymposium on Parallel Algorithms and Architectures (SPAA95), ACM, Santa Barbara, 1995, pp. 213–223. Also to appear in Algorithmica, special issue on Computational Biology, 1998.
P.W.K. Rothemund, “ADNA and restriction encyme implementation of turing machine,” inDNA Based Computers, Proc. of a DIMACS Workshop, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, R.J. Lipton and E.B. Baum (Eds.), 1996, pp. 75–119.
S. Roweis, E. Winfree, R. Burgoyne, N.V. Chelyapov, M.F. Goodman, P.W.K. Rothemund, and L.M. Adleman, “A sticker based model of DNA computation,” in Proc. of Second Annual Meeting on DNA Based Computers, E.B. Baum et al. (Eds.), 1996, pp. 1–27.
K. Sakamoto, D. Kiga, K. Komiya, H. Gouzu, S. Ikeda, S. Yokoyama, and M. Hagiya, “State transitions by molecules,” in Proc. of the 4th DIMACS Meeting on DNA Based Computers'98, 1998, pp. 87–99.
H. Tamaki and T. Sato, “Unfold/fold transformations of logic programs,” in Proc. of 2nd International Logic Programming Conference, 1984, pp. 127–138.
S.A. Tärnland, “Horn clause computability,” BIT, vol. 17, no. 2, pp. 215–226, 1977.
E. Winfree, “Complexity of restricted and unrestricted models of molecular computation,” in DNA Based Computers, Proc. of a DIMACS Workshop, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, R.J. Lipton and E.B. Baum (Eds.), 1996, pp. 187–198.
E. Winfree, “Whiplash PCR for O(1) computing,” in Proc. of The Fourth DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 1998, pp. 175–188.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kobayashi, S. Horn Clause Computation with DNA Molecules. Journal of Combinatorial Optimization 3, 277–299 (1999). https://doi.org/10.1023/A:1009893911892
Issue Date:
DOI: https://doi.org/10.1023/A:1009893911892