Define rule-based expert system, Data Structure & Algorithms

1. Define the following terms in a rule-based expert system?

a) Knowledge base
b) Inference engine

2. What is a fuzzy rule? Explain the difference between classical and fuzzy rules.



Posted Date: 3/15/2013 3:03:07 AM | Location : United States

Related Discussions:- Define rule-based expert system, Assignment Help, Ask Question on Define rule-based expert system, Get Answer, Expert's Help, Define rule-based expert system Discussions

Write discussion on Define rule-based expert system
Your posts are moderated
Related Questions
Need help with Data Structures assignment requiring C++ program

Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

Explain the halting problem Given a computer program and an input to it, verify whether the program will halt on that input or continue working indefinitely on it.

Asymptotic notation Let us describe a few functions in terms of above asymptotic notation. Example: f(n) = 3n 3 + 2n 2 + 4n + 3 = 3n 3 + 2n 2 + O (n), as 4n + 3 is of

Column Major Representation In memory the second method of representing two-dimensional array is the column major representation. Under this illustration, the first column of

Range: A Structured Type in Ruby Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss rang

Time Complexity:- The time complexity of an algorithm is the amount of time it requires to run to completion. Some of the reasons for studying time complexity are:- We may be in

In this unit, the following four advanced data structures have been practically emphasized. These may be considered as alternative to a height balanced tree, i.e., AVL tree.

A Binary Search Tree is binary tree which is either empty or a node having a key value, left child & right child. By analyzing the above definition, we notice that BST comes int