TY - GEN
T1 - Biologically inspired rule-based multiset programming paradigm for soft-computing
AU - Krishnamurthy, E. V.
AU - Murthy, V. K.
AU - Krishnamurthy, Vikram
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
KW - Biologically-inspired paradigm
KW - Closed and open systems
KW - DNA
KW - First and Second order logic
KW - Genetic and Molecular computing
KW - Probabilistic Rule based paradigm
KW - Soft computing
UR - http://www.scopus.com/inward/record.url?scp=4143099355&partnerID=8YFLogxK
U2 - 10.1145/977091.977112
DO - 10.1145/977091.977112
M3 - Conference contribution
SN - 1581137419
SN - 9781581137415
T3 - 2004 Computing Frontiers Conference
SP - 140
EP - 149
BT - 2004 Computing Frontiers Conference
PB - Association for Computing Machinery (ACM)
T2 - 2004 Computing Frontiers Conference
Y2 - 14 April 2004 through 16 April 2004
ER -