Scribd Logo
Upload

Welcome to Scribd!

  • Monkey and Banana

    Uploaded by

    gangad benal
    16 views10 pages
    1. The document describes an initial state where a monkey is hungry and on the floor, while a banana is on the ceiling and the monkey's goal is to eat the banana. 2. It provides production rules that allow moving objects between a chair, desk, and floor. 3. By applying the production rules over multiple iterations, the working memory is updated until it reaches the goal state where the monkey is happy after eating the banana while on the chair.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document describes an initial state where a monkey is hungry and on the floor, while a banana is on the ceiling and the monkey's goal is to eat the banana. 2. It provides production rules that allow moving objects between a chair, desk, and floor. 3. By applying the production rules over multiple iterations, the working memory is updated until it reaches the goal state where the monkey is happy after eating the banana while on the chair.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views10 pages

    Monkey and Banana

    Uploaded by

    gangad benal
    1. The document describes an initial state where a monkey is hungry and on the floor, while a banana is on the ceiling and the monkey's goal is to eat the banana. 2. It provides production rules that allow moving objects between a chair, desk, and floor. 3. By applying the production rules over multiple iterations, the working memory is updated until it reaches the goal state where the monkey is happy after eating the banana while on the chair.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 10

    Monkey and Banana Problem

    ceiling

    Initial State { room


    Hungry(monkey),
    isOn(Chair, floor),
    isOn(Desk, floor),
    isOn(Banana, ceiling),
    isOn(Monkey, floor) }

    Monkey Desk
    Chair

    floor
    ceiling

    Goal State { room


    Happy(monkey), Monkey
    isOn(Chair, Desk),
    isOn(Desk, floor),
    Eat(Monkey, Banana),
    isOn(Monkey, Chair) }

    Chair

    Desk

    floor
    ceiling

    Working Memory { room


    Hungry(Monkey),
    isOn(Chair, Floor),
    isOn(Desk, Floor),
    isOn(Banana, cEiling),
    isOn(Monkey, Floor) }

    Production Rules
    1. If isOn(C, F) & isOn(D, F) Monkey Desk
    Chair
    Then isOn(C, F) -> isOn(C,D)
    2. If isOn(M,F) & isOn(C,F)
    Then isOn(M,F) -> isOn(M,C)
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D)
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)
    ceiling

    Working Memory { room


    Hungry(Monkey),
    isOn(Chair, Desk),
    isOn(Desk, Floor),
    isOn(Banana, cEiling),
    isOn(Monkey, Floor) } Chair

    Production Rules
    1. If isOn(C, F) & isOn(D, F) Monkey Desk
    Then isOn(C, F) -> isOn(C,D)
    2. If isOn(M,F) & isOn(C,F)
    Then isOn(M,F) -> isOn(M,C)
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D) Iteration 0 : rule1 fired
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)
    ceiling

    Working Memory { room


    Hungry(Monkey),
    isOn(Chair, Desk),
    isOn(Desk, Floor),
    isOn(Banana, cEiling),
    isOn(Monkey, Desk) } Chair

    Production Rules
    1. If isOn(C, F) & isOn(D, F) Monkey Desk
    Then isOn(C, F) -> isOn(C,D)
    2. If isOn(M,F) & isOn(C,F)
    Then isOn(M,F) -> isOn(M,C)
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D) Iteration 1 : rule3 fired
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)
    ceiling

    Working Memory { room


    Hungry(Monkey),
    isOn(Chair, Desk),
    isOn(Desk, Floor), Monkey
    isOn(Banana, cEiling),
    isOn(Monkey, Chair) } Chair

    Production Rules
    1. If isOn(C, F) & isOn(D, F) Desk
    Then isOn(C, F) -> isOn(C,D)
    2. If isOn(M,F) & isOn(C,F)
    Then isOn(M,F) -> isOn(M,C)
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D) Iteration 2 : rule4 fired
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)
    ceiling

    Working Memory { room


    Hungry(Monkey),
    isOn(Chair, Desk),
    isOn(Desk, Floor), Monkey
    Eat(Monkey, Banana),
    isOn(Monkey, Chair) }

    Production Rules
    1. If isOn(C, F) & isOn(D, F) Chair
    Then isOn(C, F) -> isOn(C,D)
    2. If isOn(M,F) & isOn(C,F)
    Then isOn(M,F) -> isOn(M,C) Desk
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D) Iteration 3 : rule5 fired
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)
    ceiling

    Working Memory { room


    Happy(Monkey),
    isOn(Chair, Desk),
    isOn(Desk, Floor), Monkey
    Eat(Monkey, Banana),
    isOn(Monkey, Chair) }

    Production Rules
    1. If isOn(C, F) & isOn(D, F) Chair
    Then isOn(C, F) -> isOn(C,D)
    2. If isOn(M,F) & isOn(C,F)
    Then isOn(M,F) -> isOn(M,C) Desk
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D) Iteration 4 : rule6 fired
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)
    ceiling

    Working Memory { room


    Happy(Monkey),
    isOn(Chair, Desk),
    isOn(Desk, Floor), Monkey
    Eat(Monkey, Banana),
    isOn(Monkey, Chair) }
    Goal State {
    Production Rules Happy(monkey),
    1. If isOn(C, F) & isOn(D, F) isOn(Chair, Desk), Chair
    Then isOn(C, F) -> isOn(C,D) isOn(Desk, floor),
    2. If isOn(M,F) & isOn(C,F) Eat(Monkey, Banana),
    Then isOn(M,F) -> isOn(M,C) isOn(Monkey, Chair) } Desk
    3. If isOn(M,F) & isOn(D,F)
    Then isOn(M,F) -> isOn(M,D)
    4. If isOn(M,D) & isOn(C,D)
    Then isOn(M,D) -> isOn(M,C) floor
    5. If isOn(M,C) & isOn(C,D) Goal state !!
    Then isOn(B,E) -> Eat(M,B)
    6. If Eat(M,B)
    Then Hungry(M) -> Happy(M)

    You might also like