Rule-based programming paradigm: A formal basis for biological, chemical and physical computation

BioSystems

Volumn 49, Issue 3, 1999, Pages 205-228

  Krishnamurthy, Vikram ^a   Krishnamurthy, E V ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Closed world assumption; Database transaction processing; DNA; First and second order logic; Genetic and molecular computing; Rule based paradigm

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DATA BASE; MOLECULAR GENETICS; PROBABILITY; TIME;

EID: 0033005966     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(98)00083-5     Document Type: Article

References (54)

1. Adelman, L.M., 1994. Molecular computation of solutions to combinatorial problems. Science 266, 1021-1024.
2. Banatre, J.-P., Me'tayer, D.L., 1990. The Gamma model and its discipline of programming. Sci. Comput. Program. 15, 55-77.
3. Banatre, J.-P., Me'tayer, D.L., 1993. Programming by multiset transformation. Comm. ACM 36, 98-111.
4. Belew, R.K., Forrest, S., 1988. Learning and programming in classifier systems. Mach. Learn. 3, 193-223.
5. Bloch, A., 1994. Hamiltonian and Gradient Flows, Algorithms and Control, American Mathematical Society, Providence, RI.
6. Booker, L.K., Goldberg, D.E., Holland, J.H., 1989. Classifier systems and genetic algorithms. Artif. Intell. 40, 235-282.
7. Branke, J., Andersen, H.C., Schmeck, H.,1996. Global selection methods for massively parallel computers. In: Fogany, T.C. (Ed.), Evolutionary Computing Lecture notes in Computer Science, vol. 1143. Springer, Berlin, pp. 175-188.
8. Brockelt, R.W., 1991. Dynamical systems that son lists, diagonalize matrices and solve linear programming problems. Linear Algebra Appl. 146, 79-91.
9. Conrad, M., 1992. Molecular computing paradigms. Computer 25, 6-68.
10. Conrad, M., Zauner, K.-P., 1997. Molecular computing: From conformational pattern recognition to complex processing networks. Bioinformatics, Lecture notes in Computer Science, vol. 1278. Springer, Berlin, pp. 1-10.
11. Conrad, M., Zauner, K.-P., 1998. DNA as a vehicle for the self-assembly model of computing. Biosystems 45, 59-66.
12. David, R., Alla, H., 1992. Petri Nets and Grafcet. Prentice Hall, New York.
13. Deift, P., 1996. Integrable Hamiltonian systems, Dynamical systems and Probabilistic methods in PDE, Lecture notes In Applied mathematics, vol. 31. American Mathematical Society, Providence, RI, pp. 103-138.
14. Faybusowich, L., 1991. Hamiltonian structure of dynamical systems which solve linear programming problems. Physica 53, 217-232.
15. Fernandez-Villacanas, J.L., Fatah, J.M., Amin, S., 1998. Computing with Evolving Proteins, Parallel and Distributed Processing. In: Rolim, J. (Ed.), Lecture Notes in Computer Science, vol. 1388. Springer, Berlin, pp. 207-215.
16. Feynman, R.P., 1986. Quantum mechanical computers. Found. Phys. 16, 507-531.
17. Forrest, S., 1991a. Parallelism and Programming in classifier systems. Morgan Kauffman, San Mateo, CA.
18. Forrest, S., 1991b. Emergent Computation. MIT Press, Cambridge, MA.
19. Genesereth, M.H, Nilsson, N., 1987. Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Los Altos, CA.
20. Goldberg, D.E., 1989. Genetic algorithms in search, optimisation and machine learning. Addison Wesley, Reading, MA.
21. Grefenstett, J.J., 1988. Credit assignment in rule discovery systems based on genetic algorithms. Mach. Learn. 3, 225-245.
22. Gregory, R.T., Krishnamunhy, E.V., 1984. Methods and applications of error-free computing. Springer, Berlin.
23. Holland, J.H. et al., 1987. Induction. MIT Press, Cambridge, MA.
24. Ishida, T., 1991. Parallel, Distributed and Multiagent Production Systems, Lecture Notes in Computer Science, vol. 890. Springer, Berlin.
25. Kauffman, S.A., 1993. The Origins of Order, Oxford university Press, London.
26. Kogge, P.M, 1991. The Architecture of Symbolic Computers. McGraw-Hill, New York.
27. Krishnamurthy, E.V., 1985. Introductory Theory of Computer Science. Springer, Berlin.
28. Krishnamurthy, E.V., 1989. Parallel Processing. Addison Wesley, Reading, MA.
29. Krishnamurthy, E.V., Murthy, V.K., 1992. Transaction Processing Systems. Prentice Hall, Englewood Cliffs, NJ.
30. Krishnamurthy, E.V., 1996. Complexity Issues in Parallel and distributed computing. In: Zomaya, A. (Ed.), Handbook Parallel and Distributed computing, chapter 4. McGraw Hill, New York.
31. Krishnamurthy, E.V, 1998. Computational power of quantum machines, quantum grammars and feasible computation. Int. J. Mod. Phys. 9, 213-241.
32. Krishnamurthy, E.V, Krishnamurthy, V., 1998. Integrability,Neural and Quantum Computational complexity, World Multiconferene on Systemics. Cybernetics and Informatics, Orlando.
33. Kuo, S., Moldovan, D., 1992. The state of the art in parallel production systems. J. Parallel Distrib. Comput. 15, 1-26.
34. Kulic, I.M, 1998. Evaluating polynomials on the molecular level - a novel approach to molecular computers. Biosystems 45, 45-57.
35. Lipton, R.J, 1995. DNA solution to hard computational problems. Science 268, 542-545.
36. Michalewicz, Z., 1992. Genetic Algorithms + data structures = Evolution Programs. Springer, Berlin.
37. Miranker, D.P., 1991. TREAT: A new efficient match algorithm for AI Production Systems. Pitman, London.
38. Misra, B., Prigogine, I., Courbage, M., 1986. From deterministic dynamics to probabilistic descriptions. Physica 98, 1-26.
39. Muehlenbein, H., 1991. Evolution in Time and Space-the parallel genetic algorithm. In: Rawlins, G. (Ed.), Foundations of Genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp. 316-337.
40. Murthy, V.K., Krishnamurthy, E.V., 1995. Probabilistic parallel programming based on multiset transformation. Future Gener. Comput. Syst. 11, 283-295.
41. Papadimitriou, C.H., 1995. Computational Complexity. Addison Wesley, Reading, MA.
42. Petrina, D.Ya., 1995. Mathematical Foundations of Quantum Statistical Mechanics. Kluwer, Dordrecht.
43. Prigogine, I., 1980. From being to becoming. W.H. Freeman, San Fransisco, CA.
44. Prigogine, I., Elskens, Y., 1987. Quantum Implications, Rouledge and Kegan Paul, London, pp. 205-219.
45. Rambidi, N.G., 1997. Biomolecular computer: roots and promises. Biosystems 44, 1-15.
46. Reif, J.H., 1995. Parallel Molecular computation: Models and simulations. Seventh Annual ACM Symposium on Parallel Algorithms and Architecture.
47. Reisig, W., 1985. Petri Nets. Springer, Berlin.
48. Rich, E., Knight, K., 1991. Artificial Intelligence. McGraw-Hill, New York.
49. Smith, H.L., 1996. Monotone Dynamical Systems, American Mathematical Society, Providence, RI.
50. Spears, W.M., De Jong, K.A., 1993. An overview of evolutionary computation, Machine Learning ECLML93. Lecture Notes in Computer Science, vol. 667, Springer, Berlin, pp. 442-459.
51. van Gelder, T., 1996. Dynamics and Cognition. In: Haugeland, J.(Ed.), Mind Design II, Chapter 16. MIT Press, Cambridge, MA.
52. Vose, M.D., 1991. Generalizing the notion of schema in genetic algorithms. Artif. Intell. 50, 385-396.
53. Whitley, D., Starkweather, T., 1990. Genitor: a distributed genetic algorithm. J. Exp. Theor. Artif. Intell. 2, 184-214.
54. Zauner, K.-P., Conrad, M., 1996. Parallel computing with DNA: toward the Anti-Universal Machine, Proceedings of PPSN-IV, Lecture Notes in Computer Science, vol. 1141. Springer, New York.