Introduction to Artificial Intelligence

• Lecture: Wednesdays 10:15 - 11:45 (Room: 2.037)
• Exercise: Mondays 08:30 - 10:00 (Room: 01.155-N -- small extra room in the CIP-Pool 1st floor)

• Introduction to Prolog for "Generation Google"
• Introduction to PROLOG (german slides) (.ps.gz, .2.ps.gz, .4.ps.gz, .8.ps.gz)
• Procedural semantics of PROLOG (.ps)
• SWI-Prolog documentation

• Chapter 1: Artificial Intelligence
  1. How to test something according to the Turing test?
  2. What is the goal of cognitive science?
  3. What is the content of Gödels incompleteness theorem?
  4. Why behaviorism was introduced, and where it failed?
  5. Is there continously progress of AI?
  6. What are current methods to find out how people think?
  7. Are there laws of thought? How to define them?
  8. What result of philosophy is important for AI?
  9. What result of Mathematics is important for AI?
  10. What result of Psychology is important for AI?
• Chapter 2: Intelligent Agents
  1. What is a rational agent?
  2. What can a table-driven agent do?
  3. How works the skeleton agent?
  4. How decides the simple reflex agent what to do?
  5. what is the difference between the simple reflex agent and the agent that keeps track of the world?
  6. How selects the goal-based agent the next action?
  7. What evaluates the utility-based agent?
  8. What does it mean if the environment is called inaccessible?
  9. What achieves the environment program?
  10. What is an environment class? How to classify environment?
• Chapter 3: Solving Problems by Searching
  1. What are the parts of the simple problem solving agent?
  2. How to describe a problem?
  3. Which of the problem types can be solved by searching?
  4. Describe a problem of your choice!
  5. What does it mean to expand a search node?
  6. Which search strategy leads to efficient search?
  7. Compare depth-first search and breadth-first search!
  8. Define bidirectional search!
  9. How to avoid repeated states?
  10. How to implement constraint checking and forward checking?
• Chapter 4: Informed Search Methods
  1. How is knowledge introduced into searching?
  2. What are the characteristics of Greedy search
  3. What is an admissible heuristic function?
  4. What are the characteristics of A* search?
  5. How to find a heuristic function?
  6. What is the base idea of A*?
  7. Are there ways to restrict memory usage of A*?
  8. What is the conceptual difference between IDA and SMA?
  9. What are the problems with hill climbing?
  10. How to overcome the hill climbing problems?
• Chapter 5: Game Playing
  1. How to determine the value of a search node using minimax?
  2. What is the form of a typical evaluation function?
  3. When cut-off of the search tree is a good idea?
  4. What is the horizon problem?
  5. alpha-beta-pruning: How changes alpha, how changes beta?
  6. How we have to change minimax if we have to introduce an element of chance?
• Chapter 6: Agents that Reason Logically
  1. If the knowledge-based agent is to generate actions can its knowledge be restricted to knowledge about the world only?
  2. Are facts part of the world or are facts (statements) about the world?
  3. Look at 6.1! How you understand the parameter t?
  4. Search for the functions MAKE-PERCEPT-SENTENCE, MAKE-ACTION-QUERY, and MAKE-ACTION-SENTENCE! What are your proposals?
  5. Is there a knowledge level? What can be done here? Is it of any worth?
  6. What does it mean to "mark a square"?
  7. is there any difference between 6.2 and 6.3?
  8. Is a locial sentence a physical pattern of electrons? To which level logical sentences are said to be associated?
  9. Are there sentences which do not refer to facts in the world?
  10. is the semantics of a sentence the truth or falsity of a sentence or the fact?
  11. is reasoning a concept of the knowledge level, the logical level or the
  12. plementation level? Makes the sentence in italics on page 158 any sense?
  13. Is the solar system obeying a law or do we describe their behavior by a socalled law? What expresses the word "follows" in 6.5?
  14. Has entailment semantic or syntactic quality?
  15. What is searched in the haystack?
  16. Has inference semantic or syntactic quality?
  17. What is a sound inference procedure? What is a complete inference procedure?
  18. How can a computer language describe the state of the computer?
  19. What is the semantics of the sentence "Look!"?
  20. Is it possible to say true things about the world without any knowledge?
  21. Knows a computer interpretations of stored sentences?
  • Use the terminus "Logics" as equivalent to "logical language"!
  • Use the terminus "logical calculus" as equivalent to "logical language+deduction rules"!
  22. Can a fact be in one of the states true or false? Note that the idea the world consists of facts is only an assumption!
  24. Can you imagine additional states of knowledge about a fact?
  25. How we can remove the ambiguity in thepropositional logic?
  26. Construct a semantics for ((PvQ)&-Q)->P!
  27. Construct a truth table for (((P&-Q)v(Q->-P))v(P<->Q))!
  28. How one can use the truth table to check for the truth of a conclusion?
  29. What is a model?
  30. What is an inference rule?
  31. What is the status of the subscripts in S1,2?
  32. What is the difference between a rule (implication) and an inference rule?
  33. What is the fact intended to be the meaning of Forward?
  34. Why can propostional logic not handle the wumpus world?
  35. What changes in the wumpus world?
• Chapter 7
  1. Can you find a fact which does not relate objects?
  2. What is the semantics of an object constant? of a function symbol? of a predicate?
  3. Do you know of the Prolog conventions for variables and constants?
  4. Is the equality symbol a predicate symbol?
  5. What is the semantics of a atomic ground sentence?
  6. When is a atomic ground sentence true?
  7. Which general problem of higher order logic is undecidable?
  8. How do we know when we have written down enough axioms to fully specify a domain?
  9. How do we know when we have too many sentences?
  10. How works MAKE-ACTION-SENTENCE?
  11. Why can the simple reflex agent not bring home the gold?
  12. Why it is easier to find a statement like "my keys are in my pocket" compared to find a statement "I feel the keys in my pocket at time t"?
  13. How can one update sentences?
  14. What is a calculus? Is the situation calculus a calculus?
  15. What is a situation?
  16. Which kinds of axioms describe actions in the situation calculus?
  17. Do we need the agent parameter?
  18. Define Orientation and Mod!
  19. Why are causal rules synchronic rules?
  20. Is the model-based rule including knowledge about wumpus and pit the best to represent safety?
  21. What are goals?
  22. How can Ask deliver a sequence of actions?
• Chapter 8
  1. When is a knowledge basis expressive, concise, unambiguous, context-insensitive, effective, clear, correct?
  2. What is the problem with BearOfVerySmallBrain?
  3. Can we infer new facts? Can I write down a fact?
  4. How one can decide what to talk about if one does not understand it?
  5. How to determine the general knowledge about the domain? comment: representing knowledge of the commonsense world is impossible, because the categories are not well defined
  6. How to represent categories?
  7. What is reification? Did we reify functions already? comment: Instances do not inherit properties from their category (p.230)
  8. Do we need exact defintions of the categories?
  9. What is essential for a measure?
  10. Give an example for a SubEvent!
  11. Explain the event calculus!
  12. Are the additional relations between intervals?
  13. What is the difference between liqueid and not liquid events?
  14. What are intrinsic properties?
  15. What is the opposite of referential transparency?
  16. Try to define "guess"!
  17. describe: the oranges are in regal3 and cost $3/lib!
  18. describe: agent A1 wants to buy oranges!
  19. describe: agent A1 sees the sign "oranges"
  20. describe: agent A1 sees the sign "oranges are $3/lib"

• Russell, S., Norvig, P.: Artificial Intelligence --- A Modern Approach.
  Upper Saddle River, New Jersey: Prentice Hall, 1995