Introduction to AI & AI Principles (Semester 1) WEEK 5 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 5 – Wednesday (2008/09) John Barnden.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Fundamentals/ICY: Databases 2013/14 Week 6: Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
1 Business 90: Business Statistics Professor David Mease Sec 03, T R 7:30-8:45AM BBC 204 Lecture 5 = More of Chapter “Presenting Data in Tables and Charts”
What’s wrong with this proof? If you figure it out, don’t call it out loud – let others ponder it as well. 1. Let a and b be non-zero such thata = b 2.
Introduction to AI & AI Principles (Semester 1) WEEK 6 – Tuesday Introduction to AI & AI Principles (Semester 1) WEEK 6 – Tuesday (2008/09) John Barnden.
CSE (c) S. Tanimoto, 2008 Propositional Logic
Introduction to AI & AI Principles (Semester 1) WEEK 2 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 3 (07/08) John Barnden Professor of Artificial Intelligence School of Computer Science University.
Introduction to AI & AI Principles (Semester 1) WEEK 8 Introduction to AI & AI Principles (Semester 1) WEEK 8 (2008/09) John Barnden Professor of Artificial.
Introduction to AI & AI Principles (Semester 1) WEEK 11 (Wed) – Wrap-Up (2008/09) John Barnden Professor of Artificial Intelligence School of Computer.
Introduction to AI & AI Principles (Semester 1) WEEK 8 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.
Introduction to AI & AI Principles (Semester 1) WEEK 9 - Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 9 - Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) REVISION LECTURES (Term 3) John Barnden Professor of Artificial Intelligence School of Computer Science.
Introduction to AI & AI Principles (Semester 1) WEEK 7 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.
Introduction to AI & AI Principles (Semester 1) WEEK 2 – Tuesday part B Introduction to AI & AI Principles (Semester 1) WEEK 2 – Tuesday part B (2008/09)
Introduction to AI & AI Principles (Semester 1) REVISION LECTURES (Term 3) John Barnden Professor of Artificial Intelligence School of Computer Science.
Introduction to AI & AI Principles (Semester 1) WEEK 10 (07/08) [John Barnden’s slides only] School of Computer Science University of Birmingham, UK.
Introduction to AI & AI Principles (Semester 1) WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 2 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 2 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 11 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 2 Introduction to AI & AI Principles (Semester 1) WEEK 2 (2007/08) John Barnden Professor of Artificial.
Introduction to AI & AI Principles (Semester 1) WEEK 6 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 6 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 2 – Tuesday part A Introduction to AI & AI Principles (Semester 1) WEEK 2 – Tuesday part A (2008/09)
Introduction to AI & AI Principles (Semester 1) WEEK 3 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 3 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 4 (07/08) John Barnden Professor of Artificial Intelligence School of Computer Science University.
Introduction to AI & AI Principles (Semester 1) WEEK 1 Introduction to AI & AI Principles (Semester 1) WEEK 1 (2008/09) Tuesday (b): Exercises John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 1 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 1 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 8 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 8 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 8 – Wednesday: answer to Exercise 3(b) Introduction to AI & AI Principles (Semester 1) WEEK 8 (2008/09)–
Introduction to AI & AI Principles (Semester 1) WEEK 3 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part B Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part B (2008/09)
Introduction to AI & AI Principles (Semester 1) WEEK 4 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 4 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part A Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part A (2008/09)
Welcome to Unit 3: Persuasive Speaking! Sections have moved. Sit with your section & group! Feel free to move down front if it would help you learn.
Intro to Maths for CS: 2013/14 Sets (2) – OPTIONAL MATERIAL John Barnden Professor of Artificial Intelligence School of Computer Science University of.
1 Day 3 Directories Files Moving & Copying. 2 Case Sensitive First thing to learn about UNIX is that everything is case sensitive. Thus the files: –enda.
Fundamentals/ICY: Databases 2010/11 WEEK 5 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Natural Language and Logic: Some Difficulties John Barnden Professor of Artificial Intelligence School of Computer Science
Intro to Maths for CS 2012/13 REVISION WEEK John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Fundamentals/ICY: Databases 2012/13 WEEK 5 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Fundamentals/ICY: Databases 2012/13 WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Fundamentals/ICY: Databases 2013/14 Week 10 –Monday –Normalization, contd John Barnden Professor of Artificial Intelligence School of Computer Science.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Intro to Maths for CS: 2012/13 Sets (week 1 part) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Fundamentals/ICY: Databases 2012/13 WEEK 11 – 4 th Normal Form (optional material) John Barnden Professor of Artificial Intelligence School of Computer.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
1 CS161 Introduction to Computer Science Topic #9.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Friday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Praying for Risk.
Fundamentals/ICY: Databases 2013/14 Week 5: Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.
Fundamentals/ICY: Databases 2013/14 Week 4: Friday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Intro to Maths for CS: 2012/13 Sets (end, week 3) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Fundamentals/ICY: Databases 2013/14 Week 11 – Monday – relations, ended. John Barnden Professor of Artificial Intelligence School of Computer Science University.
Fundamentals/ICY: Databases 2013/14 Week 3: Monday Intro to Some Main Themes John Barnden Professor of Artificial Intelligence School of Computer Science.
MA10209 – Week 3 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 How to go about a proof  Step 1: Identify what you need to show  Sometimes.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
Lecture 2 Discrete Mathematics 9/3/ Introduction What is Discrete Mathematics? Discrete Mathematics concerns processes that consist of a sequence.
Intro to Maths for CS 2014/15 REVISION WEEK: nature of exam, and Q&A re Term 1 John Barnden Professor of Artificial Intelligence School of Computer Science.
Evaluating Compound Propositions
Fundamentals/ICY: Databases 2013/14 WEEK 8 –Monday
Introduction to Logic for Artificial Intelligence Lecture 2
Fundamentals/ICY: Databases 2010/11 WEEK 1
Commas.
Fundamentals/ICY: Databases 2013/14 WEEK 6 - Friday
John Barnden Professor of Artificial Intelligence
I am a student. We are students. You are a student. You are students. He is a student. She is a student. It is a student. They are students.
Presentation transcript:

Introduction to AI & AI Principles (Semester 1) WEEK 5 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 5 – Wednesday (2008/09) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

Reminder Representing the Information in a situation (Planning the Delivery of One Drink, contd)

Reminder Possible Logical Forms, 1(corrected) uD is a door. (D is the door’s name. We might use D-KS, say, as D.) l is-door(D). uD [stated separately to be a door] is open. l is-open(D) uDoor [stated separately to be a door] D is closed. l is-closed(D) ¬is-open(D) l is-closed(D) or ¬is-open(D) uD is an open door l is-door(D)  is-open(D) uMike (M) is in the sitting-room (S). l in(M, S) in(S, M) l in(M, S) or in(S, M) [Caution children! Do it consistently!]

Possible Logical Forms, 2 uD-KS connects the kitchen (K) and sitting-room (S). l door-connects(D-KS, K, S) [but other “argument” orders are usable] uMike is holding B [which is a bottle] [somehow or other] l holds0(Mike, B) uMike’s right hand is free. l is-free(the-right-hand-of(Mike)) uI am holding B in my right hand l holds-in-right-hand(Ego, B) l holds1(Ego, B, the-right-hand-of(Ego))

Possible Logical Forms, 3 uI am holding B in both hands l holds-in-both-hands(Ego, B) l holds2(Ego, B, the-right-hand-of(Ego), the-left-hand-of(Ego)) l holds3(Ego, B) A less good option would be l holds1(Ego, B, the-right-hand-of(Ego))  holds1(Ego, B, the-left-hand-of(Ego)) holds1(Ego, B, the-left-hand-of(Ego)) uI am holding B in one hand l holds1(Ego, B, the-right-hand-of(Ego))  holds1(Ego, B, the-left-hand-of(Ego)) holds1(Ego, B, the-left-hand-of(Ego))

Cautions about Logical Expressions uReminder: the order of “arguments” is arbitrary, holds1 l but you must be consistent for any given “predicate symbol” such as holds1 the-right-hand-of l or for any given “function symbol” such as the-right-hand-of. uA predicate symbol is for constructing assertions (statements that something is the case) about the entities referred top by the arguments in the assertion. uA function symbol is for constructing expressions that refer to entities related to entities referred to by the arguments in the expression. Mike uAn [individual] constant such as Mike or D-KS or B is a basic means for referring to an entity.

Cautions, contd. uThe symbols themselves are arbitrary. zsljkhHGCVnholds1 l E.g., you could use zsljkhHGCVn instead of holds1, JaneMike l or Jane instead of Mike to refer to the person called “Mike”!! uThis is similar to the case of user-chosen names in computer programs. uBut it’s just convenient to invent logical symbols that are similar to appropriate human-language words. uCaution Children! Don’t read too much into symbols that look like words. The AI system doesn’t regard them as words and even if it did would probably not understand them at all, or as richly as you do.

Exercises on Logic Expression 1)holds0(Mike, B)  is-open(D-KH) 2)next-to(Mike,D-KS)   is-open(the-door-of(F)) [remember that F refers to the fridge door] 3)Mike is holding the bottle or I am not holding it. 4)I am next to the fridge and the bottle is in it. 5)I am not holding the bottle in my right hand. 6)The bottle is empty. [Invent a new symbol.] 7)The bottle is full. [Invent a new symbol.] 8)The bottle is neither full nor empty. 9)The bottle is open.