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
This question deals with AVL trees. You must use mutable pairs/lists to implement this data structure: (a) Define a procedure called make-avl-tree which makes an AVL tree with o

A town contains a total of 5000 houses. Every house owner has to pay tax based on value of the house. Houses over $200 000 pay 2% of their value in tax, houses over $100 000 pay 1.

Ways to implement abstract data types A large part of the study of data structures and algorithms is learning about alternative ways to implement an ADT and evaluating alternat

draw a flowchart which prints all the even numbers between 1-50

Binary search technique:-  This technique is applied to an ordered list where elements are arranged either in ascending order or descending order. The array is separated into t

Given a number that is represented in your data structure, you will need a function that prints it out in base 215 in such a way that its contents can be checked for correctness. Y

Explain an efficient and effective way of storing two symmetric matrices of the same order in the memory. A n-square matrix array will be symmetric if a[j][k]=a[k][j] for all j

In a doubly linked list, also called as 2 way list, each node is divided into 3 parts. The first part is called previous pointer field. It contains the address of the preceding

Write an algorithm for searching a key from a sorted list using binary search technique 1.   if (low > high) 2.     return (-1) 3.    mid = (low +high)/2; 4    .if ( X

This section prescribes additional exercise with the recursive and iterative handling of a binary search tree. Adding to the Binary Search Tree Recursively Add implementation