skip to main content
10.1145/977091.977112acmconferencesArticle/Chapter ViewAbstractPublication PagescfConference Proceedingsconference-collections
Article

Biologically inspired rule-based multiset programming paradigm for soft-computing

Published:14 April 2004Publication History

ABSTRACT

This paper describes a rule-based multiset programming paradigm, as a unifying theme for biological, chemical, DNA, physical and molecular computations. The computations are interpreted as the outcome arising out of deterministic, nondeterministic or stochastic interaction among elements in a multiset object space which includes the environment. These interactions are like chemical reactions and the evolution of the multiset can mimic the biological evolution. Since the reaction rules are inherently parallel, any number of actions can be performed cooperatively or competitively among the subsets of elements, so that the elements evolve toward an equilibrium or an emergent state. Hence, this paradigm is widely applicable; e.g., to conventional algorithms, evolutionary algorithms, Markov chain Monte Carlo based Bayesian inference, genetic algorithms, self-organized criticality and active walker models (swarm and ant intelligence), DNA and molecular computing. Practical realisation of this paradigm is achieved through a coordination programming language using Multiset and transactions. This paradigm permits carrying out parts or all of the computations independently on distinct processors and is eminently suitable for cluster and grid computing.

References

  1. Adelman, L.M. Molecular computation of solutions to combinatorial problems, Science, 266, 1994, 1021--1024. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Banatre, J.-P., Me'tayer, D.L. The Gamma model and its discipline of programming, Science of Computer Programming, 15 , 1990, 55--77. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Banatre, J.-P, Me'tayer, D.L. Programming by Multiset transformation, Comm.ACM, 36, 1993, 98--111. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Belew, R.K., Forrest, S. Learning and Programming in classifier Systems, Machine Learning 3, 1988, 193--223. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bonabeau, E., Dorigo, M., and Theraulaz, G. Swarm Intelligence: From natural to artificial systems, Oxford University Press, Oxford,U.K, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Booker, L.K., Goldberg, D.E., Holland, J.H. Classifier systems and Genetic Algorithms, Artificial Intelligence, 40, 1989, 235--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Calude,C.S, Paun, G., Rozenberg, G and Salomaa, A., Multiset Processing, Lecture notes in Computer Science, 2235, Springer Verlag, New York, 2001.Google ScholarGoogle Scholar
  8. Campbell, N. Biology, Benjamin/Cummings Publishing Company, New York, 1996.Google ScholarGoogle Scholar
  9. Conrad, M. Molecular Computing Paradigms, Computer 25, 6--68, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Conrad, M., Zauner, K.-P, Molecular computing: From conformational pattern recognition to complex processing networks, in Bioinformatics, Lecture notes in Computer Science 1278, 1--10, Springer Verlag, New York, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Conrad, M ., Zauner, K-P, DNA as a vehicle for the self-assembly model of computing, Biosystems, 45, 59--66, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  12. Dorigo, M.,Caro, G.D.,and Sampels, M. Ant Algorithms, Lecture Notes in Computer Science, Vol. 2463, Springer Verlag, New York, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Doucet, A., Gordon, N., Krishnamurthy, V., Particle Filters for State Estimation of Jump Markov Linear Systems, IEEE Trans Signal Processing. 49, 2001, pp.613--624. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Fernandez-Villacanas, J.L., Fatah, J.M., Amin, S. Computing with Evolving Proteins, Parallel and Distributed Processing, Ed.J. Rolim, Lecture Notes in Computer Science, Vol.1388, Springer Verlag, New York , 1998, pp.207--215.Google ScholarGoogle Scholar
  15. Forrest, S. Parallelism and Programming in classifier systems, Morgan Kauffman, San Mateo, California, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Forrest, S. Emergent Computation , M.I.T Press, Cambridge, Mass, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Genesereth, M.H, Nilsson, N. Logical Foundations of Artificial Intelligence, Morgan Kaufmann, Los Altos, California, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Goldberg, D.E. Genetic algorithms in Search, optimisation and Machine Learning, Addison Wesley, Reading, Mass. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Grefenstett, J.J. Credit Assignment in rule discovery systems based on genetic algorithms, Machine Learning, 3, 225--245, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Holland, J.H, et al., Induction, M.I.T. Press, Cambridge, Mass., 1987.Google ScholarGoogle Scholar
  21. Ishida, T. Parallel, Distributed and Multiagent Production Systems, Lecture Notes in Computer Science, 890, Springer Verlag, New York, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Kauffman, S.A. The Origins of Order, Oxford university Press, Oxford, 1993.Google ScholarGoogle Scholar
  23. Kennedy, J. and Eberhart, R.C. Swarm Intelligence, Morgan Kauffman, London, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Kogge, P.M. The Architecture of Symbolic Computers, McGraw Hill, New York, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Krishnamurthy, E.V., Solving problems by random trials, Science and computers, (A volume dedicated to Nicholas Metropolis), Editor: G.C. Rota, Advances in Mathematics, Vol.10, pp.61--81, Academic Press, New York, 1986.Google ScholarGoogle Scholar
  26. Krishnamurthy, E.V. Parallel Processing, Addison Wesley, Reading, Mass. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Krishnamurthy, E.V. and Murthy, V.K. Transaction Processing Systems, Prentice Hall, Sydney, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Kuo, S., Moldovan, D., The state of the art in parallel production systems, J. Parallel and distributed computing, 15, 1--26, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Kulic, I. M. Evaluating Polynomials on the molecular level- a novel approach to molecular computers, Biosystems, 45, 45--57, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  30. Lam,L., Nonlinear Physics for Beginners, World Scientific, Singapore, 1998.Google ScholarGoogle Scholar
  31. Lipton, R.J. DNA solution to hard computational problems, Science, 268, 542--545, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  32. Ma, W., Murthy, V.K., and Krishnamurthy, E.V., Multran - A coordination Programming Language Using Multiset and Transactions,Proc. Neural ,Parallel and Scientific Computing, V.1, pp. 301--304, Dynamic Publishers, Inc.,U.S.A., 1995.Google ScholarGoogle Scholar
  33. Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs , Springer Verlag, New York, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Miranker, D.P. TREAT: A new efficient match algorithm for AI Production Systems, Pitman, London, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Misra, B, Prigogine, I. and Courbage, M. From deterministic dynamics to probabilistic descriptions, Physica, 98A, 1--26, 1979.Google ScholarGoogle Scholar
  36. Muehlenbein, H. Evolution in Time and Space- the parallel genetic algorithm, In Foundations of Genetic algorithms, in Rawlins, G., ed. Morgan Kaufmann, San Mateo, California, 1991, 316--337. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Murthy, V.K, Krishnamurthy, E.V. Probabilistic Parallel Programming based on multiset transformation, Future Generation Computer systems, 11, 283--295, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Murthy, V.K., Krishnamurthy, V., and Krishnamurthy, E.V., Can interacting agents in www reach self-organized criticality, Smart Engineering System Design, 12, pp.165--170, ASME Press, New York, 2002.Google ScholarGoogle Scholar
  39. Papadimitriou, C.H. Computational Complexity, Addison Wesley, Reading, Mass, 1985.Google ScholarGoogle Scholar
  40. Petrina, D. Ya. Mathematical Foundations of Quantum Statistical Mechanics, Kluwer Academic Publishers, London, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  41. Prigogine, I. From being to becoming, W.H. Freeman, San Fransisco, 1980.Google ScholarGoogle Scholar
  42. Rambidi, N.G., 1997, Biomolecular Computer: roots and Promises, Biosystems, 44, 1997, 1--15.Google ScholarGoogle Scholar
  43. Robert, C.P., G. Casella, Monte Carlo Statistical Methods, Springer Verlag, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Rich, E. and Knight, K. Artificial Intelligence, McGraw Hill, New York, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Spall,J.C. Introduction to stochastic search and optimization, Wiley-Interscience, New York, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Spears, W.M., and De Jong, K.A., 1993, An overview of evolutionary computation, Machine Learning ECLML-93, Lecture Notes in Computer Science, 667, 442--459, Springer Verlag, New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Straub, D. Alternative Mathematical Theory of Nonequilibrium Phenomena, Academic Press, New York, 1997.Google ScholarGoogle Scholar
  48. Vose, M.D. Generalizing the notion of schema in genetic algorithms, Artificial Intelligence, 50, 385--396, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Whitley, D., Starkweather, T. Genitor: a distributed Genetic algorithm, J. Experimental and Theoretical Artificial Intelligence, 2, 184--214, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Wolfram, S. A New kind of Science, Wolfram Media Inc., Champaign,Ill, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Zauner, K.-P., Conrad, M. Parallel computing with DNA: toward the Anti-Universal Machine, Proc. PPSN-IV, Lecture Notes in Computer Science,1141, Springer Verlag, New York, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Biologically inspired rule-based multiset programming paradigm for soft-computing

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            CF '04: Proceedings of the 1st conference on Computing frontiers
            April 2004
            522 pages
            ISBN:1581137419
            DOI:10.1145/977091

            Copyright © 2004 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 14 April 2004

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate240of680submissions,35%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader