Evidential Reasoning Based on DNA Computation

Authors:
Rohani Binti Abu Bakar;Junzo Watada
Affiliations:
Graduate School of Information, Production and Systems, Waseda University, Fukuoka-Ken, Japan 808-0135;Graduate School of Information, Production and Systems, Waseda University, Fukuoka-Ken, Japan 808-0135
Venue:
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Year:
2009

Citing 4
Cited 0

What is Dempster-Shafer's model?

Advances in the Dempster-Shafer theory of evidence
Issues of knowledge representation in Dempster-Shafer's theory

Advances in the Dempster-Shafer theory of evidence
Molecular computation of solutions to combinatorial problems

Science
DNASequencesGenerator: A Program for the Construction of DNA Sequences

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of this study is to present an alternative approach to solve reasoning problems. DNA computing technique shows to solve evidential reasoning problems in this study. The reasoning is here executed on the basis of the concepts of plausibility and belief function. The evidential reasoning is a process dealing with problems that having both quantitative and qualitative criteria under various uncertainties including ignorance and randomness of information. The procedure to solve reasoning problem by means of DNA computing has been illustrated. An experiment shows the steadfastness of DNA computing to reach the solution of a reasoning problem.