DOC PREVIEW
MIT 6 871 - RULE-BASED SYSTEMS EXERCISES

This preview shows page 1-2-3-27-28-29 out of 29 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 29 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Rule-based Systems Exercises Page 1 6.871 Problem Set 2 Handed out: February 28, 2006 Due: March 14, 2006 RULE-BASED SYSTEMS EXERCISES INTRODUCTION There are a few important things to keep in mind as you work through this first exercise. It is, first of all, a multi-part hand-simulation problem designed to teach you many things about how rule-based systems work. While hand-simulations can be a fair amount of work, they can also be quite instructive. They help to remove the mystery about exactly how certain things are accomplished inside the system. This problem set also has a fair amount of reading, as it is intended to teach you some things. Don’t be surprise if the reading takes longer than the actual working of the problems. There is also a computer-based version of the problem, which you will do as Problem Set 3,. This is less busywork (and more fun), but not as instructive in terms of understanding the internals. The exercise is developed in several stages, in order to show you a number of different important points. In some cases it turns out that the best way to make a point is by seeing how not to do something. So you may find as you go along that there are things about the system and about the rule set you're given that are not quite correct. Have patience, because by the end of the exercise we will have fixed all of them. Finally, there is a separate answer sheet, downloadable in both Word and PDF formats from the course web site. Be sure to put all your answers on that sheet and hand in just that, in either hardcopy or electronic form, as you wish.. THE BASICS OF THE INFERENCE ENGINE GOAL In this part of the exercise you will learn first hand the basics of the inference engine, seeing exactly how backward chaining works and how explanations are generated. A SYSTEM FOR RECOMMENDING INVESTMENTS With all the different kinds of mutual funds that are available these days, it's become difficult to decide how to invest your hard-earned money. Luckily we can call on knowledge-based systems for some help. In this exercise we'll be using a simple system that can help you to decide among six of the most common categories of mutual funds. The system assumes that you have $2000 to invest and can help select among the following possibilities: • a money-market fund • an income fund (e.g., bonds) • an aggressive growth fund • a mixed growth and income fund (abbreviated “G&I”) • a conservative growth fund • a tax-free fundRule-based Systems Exercises Page 2 • none (i.e., don't invest) THE KNOWLEDGE BASE In Table 1 you'll find the knowledge base, a set of rules written in a slightly abbreviated form. To help you read the rules, we have used some formatting conventions to help make their structure clear. Consider rule 12, for instance: 12] if Investment Goal = RETIREMENT and Number Of Years To Retirement < 10 then Category Of Fund = CONSERVATIVE GROWTH Each rule is expressed in terms of an if part (the premise) and a then part (the conclusion). In rule 12 there are two clauses in the premise and (as in all of our rules) one in the conclusion. While there is no theoretical limit to the number of clauses in the premise, it is in general a very good idea to keep the premise small—say between one and six clauses. Rules with larger premises are generally an indication that the “fracturing” of knowledge into rules has not been very successful. Each clause in a rule is expressed in terms of an attribute and its value. As a formatting convention, attributes are written as phrases with their first letters capitalized (e.g., Investment Goal, Number Of Years To Retirement, Category Of Fund); values are written in all capitals (RETIREMENT, 10, CONSERVATIVE GROWTH). The first clause thus asks whether the topic Invest Goal has the value RETIREMENT, or, in smoother English, “the goal for this investment is to fund your retirement.” (Keep in mind that this is strictly for presentation here; the system pays no attention to this.) Putting the whole rule in somewhat better English, it says: if the goal for this investment is to fund your retirement, and the number of years until you retire is less than 10, then the category of fund to select is the conservative growth funds. THE INFERENCE ENGINE IN ACTION But how can we put all that knowledge to work? Our system will proceed by chaining backward. In this case the primary goal is to determine which Category of Fund to invest in. The system starts trying to determine this by retrieving all the rules that are relevant, i.e., all rules that conclude about this attribute. Conveniently enough, the rules in Table 1 are organized according to what they conclude about, so it's clear that rules 10 through 22 are the relevant ones. Assume that the system tries them in the order shown there. It would thus begin with Rule 10, chaining backward:Rule-based Systems Exercises Page 3 category 10 insurance coverage FIGURE 1 Rule 10 warns us not to invest if we don't have basic insurance coverage (i.e., use the money to buy insurance instead). But we don't know if the premise of Rule 10 is satisfied yet, that is, whether our Basic Insurance Coverage is INADEQUATE. How can the system determine that? KNOWLEDGE BASED SYSTEMS HAVE A SIMPLE DATABASE The system has a simple database in which it records any inferences it makes and any answers the user gives to questions. The first thing to do then, when trying to determine the value of any attribute, is to check the database to see if the answer is already there, either because the system deduced it earlier, or because the user told us earlier. (Recording the answers also provides some common sense and efficiency. Some facts are used in more than one rule, so if the deductions and answers were not recorded, the system would deduce them all over again or ask the user all over again.) Here's a more detailed description of what the system does to determine the value of an attribute. There are three steps to be taken: 1. Check the database to see if the answer has previously been deduced or supplied by the user. If so, that's the value to use. 2. If there's no value in the database, retrieve from the knowledge base all rules capable of deducing any value for the attribute. Try using all of those rules (i.e., for each rule, determine the truth of the premise; if the premise turns out to be true, make the


View Full Document

MIT 6 871 - RULE-BASED SYSTEMS EXERCISES

Download RULE-BASED SYSTEMS EXERCISES
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view RULE-BASED SYSTEMS EXERCISES and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view RULE-BASED SYSTEMS EXERCISES 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?