4715

4434

كارشناسي ارشد

كنترل

اصفهان: دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر

1388

يازده،142،[II]ص.: جدول،نمودار

ص.ع.به فارسي و انگليسي

فريد شيخ الاسلام، جواد عسگري

مريم ذكري

88/8/5

رسول موسوي، مازيار پالهنگ

مهندسي برق و كامپيوتر

ID4434

به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي

Verification of Rule Based Systems Based on DNAComputation Behrouz Madahian Behrouz madahian@yahoo com Date of submission 03 16 2009 Department of electrical and computer Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language Farsi Abstract As Rule Based System RBS technology gains wider acceptance the need to createand maintain large knowledge bases will assume greater importance Increased availabilityof specialized hardware and software platforms and environments to develop these systemsand greater incidence of successful commercial application have served to generateenthusiasm for the technology Demonstrating a rule base to be free from error remains oneof the obstacles to the adoption of this technology In general the procedures for domainexperts to accumulate knowledge and expertise is incremental and intuitive thus a rulebase needs to be constructed incrementally and experienced multiple times of refinement Besides an expert system is usually constructed by consulting with numerous experts andexperts may have conflict expertise Therefore it is not surprising that many rules in a rulebase may have structural errors Four typical types of structural errors includeinconsistency conflict rules incompleteness missing rules redundancy redundantrules and circularity circular depending rules Many different techniques have beendeveloped to detect the above errors in rule based systems Earlier work mainly focused ondetecting structural errors by checking rules pair wisely Recent work aimed at detectingstructural errors caused from applying multiple rules in longer inference chains Themajority of recent verification techniques involve using some graphical notation such asgraphs and Petri nets DNA computing in which parallel computing is an inherentcharacteristics can be used to solve large problems By solving a Hamiltonian pathproblem HPP for a directed graph with seven nodes for the first time Adlemandemonstrated the efficiency of using molecules in a solution to solve computationalproblems Subsequently by solving Satisfiability problem SAT Lipton demonstrated theadvantage of using the massive parallelism inherent in DNA based computing In thisstudy algorithms mainly based on Adleman s operations which are able to detect structuralerrors effectively in any form that they can arise in rule base are presented Key Words 1 Rule Based systems 2 Strucrural errors 3 Rule verification 4 DNAcomputation

فريد شيخ الاسلام، جواد عسگري

مريم ذكري

رسول موسوي، مازيار پالهنگ