1. Review: What is a logic? A formal language –Syntax – what expressions are legal –Semantics – what legal expressions mean –Proof system – a way of manipulating syntactic expressions to get other syntactic expressions (which will tell us something new) Why proofs? Two kinds of inferences an agent might want to make: –Multiple percepts  conclusions about the world –Current state & operator  properties of next state

2. Review: Types of logic

3. Review: Propositional logic: syntax

4. Review: Propositional logic: semantics

5. Entailment

6. Propositional inference: enumeration method

7. Enumeration: Solution

8. Validity and satisfiability Theorem

9. Proof methods

10. A Typical Wumpus World

11. Wumpus World Description

12. Wumpus World Sentences

15. Wumpus world: example Rules: A square has stench if and only if the square or adjacent squares contain the wumpus –R1: S 1,1 ↔ W 1,1 v W 1,2 v W 2,1 –R2: S 2,1 ↔ W 1,1 v W 2,2 v W 3,1 –… Facts: Percepts inject (TELL) facts into the KB –[There is no stench at 1,1]   S1,1 Inference: –KB contains  S1,1 then using Modus Ponens we infer  (W 1,1 v W 1,2 v W 2,1 ) –Using De Morgan’s Law we get:  W 1,1   W 1,2   W 2,1 –Using And-Elimination we get:  W1,1  W1,2  W2,1

16. Limitations of Propositional Logic 1. It is too weak, i.e., has very limited expressiveness: Each rule has to be represented for each situation: e.g., “don’t go forward if the wumpus is in front of you” takes 64 rules 2. It cannot keep track of changes: If one needs to track changes, e.g., where the agent has been before then we need a timed-version of each rule. To track 100 steps we’ll then need 6400 rules for the previous example. Its hard to write and maintain such a huge rule- base Inference becomes intractable

17. Predicate logic Predicate Logic is more expressive, because it allows us to represent : Objects Predicates (facts) Variables

18. Assume we have the following assertions (facts) Comet is a horse Prancer is a horse Comet is parent of Dasher Comet is a parent of Prancer Prancer is fast Dasher is a parent of Thunder Thunder is fast Thunder is a horse Dasher is a horse

19. Write predicate logic sentences for these facts : To do so, we need to understand the concepts of: Objects –Comet, Prancer, Dasher, etc Predicates (facts) –horse horse(Comet) –parent-ofparent-of(Comet,Dasher) Variables –horse(x)

20. Thus, we can write Comet is a horse Prancer is a horse Comet is parent of Dasher Comet is a parent of Prancer Prancer is fast Dasher is a parent of Thunder Thunder is fast Thunder is a horse Dasher is a horse horse(Comet) horse(Prancer) parent-of(Comet,Dasher) parent-of(Comet,Prancer) fast(Prancer) parent-of(Dasher,Thunder) fast(Thunder) horse(Thunder) horse(Dasher)

21. We also can write compound statements such as: not( horse(Schafer) ) horse(Comet) and parent-of(Comet,Dasher) winner(Prancer) implies fast(Prancer)

22. Suppose we have the following rule (relation) R1: if x is-a horse x is-parent-of y y is-fast then x is valuable

23. Bindings In general, there will be variables in the rules which stand for arbitrary objects. We need to find bindings for them so that the rule is applicable.

24. Bindings

25. From these we can deduce that there are two possible bindings applicable to the rule: x = Comet and y = Prancer x = Dasher and y = Thunder Since x is valuable, Comet is valuable and Dasher is valuable

26. Forward Chaining Forward Chaining or data-driven inference works by repeatedly: starting from the current state, matching the premises of the rules (the IF parts), and performing the corresponding actions (the then parts) that usually update the knowledge base or working memory. The process continues until no more rules can be applied, or some cycle limit is met.

27. Forward Chaining

28. In this example there are no more rules, so we can draw the inference chain: This seems simple enough, but this had few initial facts and few rules.

29. Disadvantages of Forward Chaining Many rules may be applicable at each stage – so how should we choose which one to apply next at each stage? The whole process is not directed towards a goal, so how do we know when to stop applying the rules?

30. Backward Chaining Backward chaining or goal-driven inference works towards a final state by looking at the working memory to see if the sub-goal states already exist there. If not, the actions (the THEN parts) of the rules that will establish the sub-goals are identified and new sub-goals are set up for achieving the premises of those rules (the IF parts).

31. Backward Chaining The previous example now becomes:

32. Backward Chaining The first part of the chain works back from the goal until only the initial facts are required, at which point we know how to traverse the chain to achieve the goal state.

33. Backward Chaining Advantage –The search is goal directed, so we only apply the rules that are necessary to achieve the goal. Disadvantage –The goal has to be known. –Fortunately, many AI systems can be formulated in a goal based fashion.