Assignments | Class Photo | Course Home | Schedule & Lecture Notes | Submit

Saint Louis University

Computer Science 115
Introduction to Computer Science
Michael Goldwasser

Fall 2004

Dept. of Math & Computer Science

Assignment 11

Artificial Intelligence

Contents:


Overview

Topic: Artificial Intelligence
Related Reading: Ch. 13 and notes (skip 13.2, 13.6)
Due: 8pm Tuesday, 7 December 2004


Internet Requirements

This assignment relies on a lab associated with the Meyer book and the associated software. You will need to have an external Internet connection to run this software (or use the CD that came with that text).


Practice Problems

Problems to be Submitted (20 points)

  1. (5 points)

    Answer Thought Question #1 of Ch. 13 (p. 448)

  2. (5 points)

    Do Exercise 1 of Lab 13 of the Meyer text; answer questions 2-5 along the way. (Semantic Network simulator)

    For questions 2, 3 and 4, please write down the rule that you added as part of your submitted solution.

    For questions 5 and 6, when asked to take a screenshot, you should instead cut-and-paste the contents of the "Deduced facts:" window into your submitted solution.

  3. (10 points)

    Many statements in a natural language, such as English, contain ambiguity for a variety of reasons. As humans, we can often (though not always) distinguish between possible meanings. Resolving such ambiguities is a great challenge for software.

    The textbook and the lecture notes discuss several sources of ambiguity, giving many examples of such ambiguities.

    For each of the five types of ambiguity below we want you to do the following.

    1. Lexical ambiguity
    2. Syntactic ambiguity
    3. Referential ambiguity
    4. The need for rules of conversation
    5. The need for real-world, topical knowledge
Overall, please type your answers to all of the problems in a single document to be submitted electronically. Please see details about the submission process.

Extra Credit (4 points)

Figure 13.4 of the text and the corresponding discussion involve a variant of the game of Nim. Interestingly, the text book never explicitly stated the most important conclusions. Assuming that both players use optimal strategies, who will win the game, Player 1 or Player 2? Explain why.

By the way, the text explained that they used a very simplified version of the game as an example. If you would like, you may play the computer in a more interesting version of the game Nim. Let me know if you are able to beat the computer. I still haven't.


CSA-115, Fall 2004
Michael Goldwasser
goldwamh at our university domain

Last modified: Sunday, 05 December 2004
Assignments | Class Photo | Course Home | Schedule & Lecture Notes | Submit