Presentation is loading. Please wait.

Presentation is loading. Please wait.

What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0,

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0,"— Presentation transcript:

1 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). ask continuous(l2, w5). prove: ?a 1 ^... ^ a k. AC := yes <- a 1 ^... ^ a k. repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

2 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- a 1 ^... ^ a k. repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

3 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

4 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

5 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

6 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

7 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(l2, w5) <- connected_to(l2, w5). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

8 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(l2, w5) <- connected_to(l2, w5). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

9 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

10 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

11 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.) OOPS! There’s no good clause in KB.

12 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.) OOPS! There’s no good clause in KB. backtrack to last choice point reset everything to what it was then make another choice

13 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.) OOPS! There’s no good clause in KB. backtrack to last choice point reset everything to what it was then make another choice

14 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.) OOPS! There’s no good clause in KB. backtrack to last choice point reset everything to what it was then make another choice

15 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(X, Y) <- connected_to(X, Z) & continuous(Z, Y). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

16 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(l2, w5) <- connected_to(l2, Z) & continuous(Z, w5). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- continuous(l2, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

17 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(l2, w5) <- connected_to(l2, Z) & continuous(Z, w5). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, Z) ^ continuous(Z, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.)

18 What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0, w1) <- up(s2). connected_to(w0, w2) <- down(s2). connected_to(w1, w3) <- up(s1). connected_to(w2, w3) <- down(s1). connected_to(l2, w4). connected_to(w4, w3) <- up(s3). connected_to(p1, w3). connected_to(w3, w5) <- ok(cb1). connected_to(p2, w6). connected_to(w6, w5) <- ok(cb2). connected_to(w5, outside). continuous(l2, w5) <- connected_to(l2, Z) & continuous(Z, w5). continuous(X, Y) <- connected_to(X, Y). prove: ?continuous(l2, w5). AC := yes <- connected_to(l2, Z) ^ continuous(Z, w5). repeat select a conjunct a i from the body of AC choose clause C from KB with a i as head replace a i in the body of AC by the body of C after making appropriate substitutions until AC is an answer (i.e., yes <-.) From this point on, it’s just a repeat of the previous example....

19 The Awesome Power of Recursion or how getting the representation right makes everything else so easy....

20 The Maze r11 - r12 - r13 - r14 - r15 - r16 - r17 r18 | | | | | r21 r22 r23 - r24 r25 - r26 r27 - r28 | | | | r31 r32 r33 - r34 - r35 r36 r37 - r38 | | | | | | r41 r42 r43 r44 - r45 - r46 r47 r48 | | | | | | r51 r52 - r53 r54 r55 r56 r57 - r58 | | | | | | r61 r62 - r63 r64 - r65 r66 - r67 r68 | | | | r71 r72 r73 r74 - r75 - r76 r77 - r78 | | | | | r81 - r82 r83 - r84 r85 - r86 r87 - r88

21 It’s time for a CILOG break! cilog: load ‘maze.ci’.

Download ppt "What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0,"

Similar presentations

After the Practical on Clausal Form and Resolution Question 5 Proving the query of Question 4.

After the Practical on Clausal Form and Resolution Question 5 Proving the query of Question 4.
Integration by Substitution and by Parts

Integration by Substitution and by Parts
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Inference Rules Universal Instantiation Existential Generalization

Inference Rules Universal Instantiation Existential Generalization
1 Introduction to Prolog References: – – Bratko, I., Prolog Programming.

1 Introduction to Prolog References: – – Bratko, I., Prolog Programming.
Basic poster template for you to adapt Stuart Johnson Student Learning Centre, University of Leicester Heading 1: Arial 12 pt bold This.

Basic poster template for you to adapt Stuart Johnson Student Learning Centre, University of Leicester Heading 1: Arial 12 pt bold This.
For Friday No reading Homework: –Chapter 9, exercise 4 (This is VERY short – do it while you’re running your tests) Make sure you keep variables and constants.

For Friday No reading Homework: –Chapter 9, exercise 4 (This is VERY short – do it while you’re running your tests) Make sure you keep variables and constants.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.

13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Vertical 1D Motion Problem. On the Moon A Moon rock ON THE MOON is thrown upward with velocity of 7 m/s. After 7 s, it has a downward velocity of 4 m/s.

Vertical 1D Motion Problem. On the Moon A Moon rock ON THE MOON is thrown upward with velocity of 7 m/s. After 7 s, it has a downward velocity of 4 m/s.
MB: 2 March 2001CS360 Lecture 31 Programming in Logic: Prolog Prolog’s Declarative & Procedural Semantics Readings: Sections 2.3 - 2.7.

MB: 2 March 2001CS360 Lecture 31 Programming in Logic: Prolog Prolog’s Declarative & Procedural Semantics Readings: Sections
CPSC 322 Introduction to Artificial Intelligence September 22, 2004.

CPSC 322 Introduction to Artificial Intelligence September 22, 2004.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.

CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322 Introduction to Artificial Intelligence September 27, 2004.

CPSC 322 Introduction to Artificial Intelligence September 27, 2004.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.

Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
CPSC 322 Introduction to Artificial Intelligence September 20, 2004.

CPSC 322 Introduction to Artificial Intelligence September 20, 2004.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.

CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Using Definite Knowledge Notes for Ch.3 of Poole et al. CSCE 580 Marco Valtorta.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Using Definite Knowledge Notes for Ch.3 of Poole et al. CSCE 580 Marco Valtorta.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.

CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
1 CILOG User Manual Bayesian Networks Seminar Sep 7th, 2006.

1 CILOG User Manual Bayesian Networks Seminar Sep 7th, 2006.

Similar presentations

Ads by Google