Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 561, Session 12-13 1 Midterm format Date: 10/10/2002 from 11:00am – 12:20 pm Location: THH 101 Credits: 35% of overall grade Approx. 4 problems, several.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "CS 561, Session 12-13 1 Midterm format Date: 10/10/2002 from 11:00am – 12:20 pm Location: THH 101 Credits: 35% of overall grade Approx. 4 problems, several."— Presentation transcript:

1 CS 561, Session 12-13 1 Midterm format Date: 10/10/2002 from 11:00am – 12:20 pm Location: THH 101 Credits: 35% of overall grade Approx. 4 problems, several questions in each. Material: everything so far, up to slide 27 in this file. Not a multiple choice exam No books (or other material) are allowed. Duration will be 1:20 hours. Academic Integrity code: see class main page.Academic Integrity

2 CS 561, Session 12-13 2 Last time: Logic and Reasoning Knowledge Base (KB): contains a set of sentences expressed using a knowledge representation language TELL: operator to add a sentence to the KB ASK: to query the KB Logics are KRLs where conclusions can be drawn Syntax Semantics Entailment: KB |= a iff a is true in all worlds where KB is true Inference: KB |– i a = sentence a can be derived from KB using procedure i Sound: whenever KB |– i a then KB |= a is true Complete: whenever KB |= a then KB |– i a

3 CS 561, Session 12-13 3 Last Time: Syntax of propositional logic

4 CS 561, Session 12-13 4 Last Time: Semantics of Propositional logic

5 CS 561, Session 12-13 5 Last Time: Inference rules for propositional logic

6 CS 561, Session 12-13 6 This time First-order logic Syntax Semantics Wumpus world example

7 CS 561, Session 12-13 7 Why first-order logic? We saw that propositional logic is limited because it only makes the ontological commitment that the world consists of facts. Difficult to represent even simple worlds like the Wumpus world; e.g., “don’t go forward if the Wumpus is in front of you” takes 64 rules

8 CS 561, Session 12-13 8 First-order logic (FOL) Ontological commitments: Objects: wheel, door, body, engine, seat, car, passenger, driver Relations: Inside(car, passenger), Beside(driver, passenger) Functions: ColorOf(car) Properties: Color(car), IsOpen(door), IsOn(engine) Functions are relations with single value for each object

9 CS 561, Session 12-13 9 Examples: “One plus two equals three” Objects: Relations: Properties: Functions: “Squares neighboring the Wumpus are smelly” Objects: Relations: Properties: Functions:

10 CS 561, Session 12-13 10 Examples: “One plus two equals three” Objects:one, two, three, one plus two Relations:equals Properties:-- Functions:plus (“one plus two” is the name of the object obtained by applying function plus to one and two; three is another name for this object) “Squares neighboring the Wumpus are smelly” Objects:Wumpus, square Relations:neighboring Properties:smelly Functions:--

11 CS 561, Session 12-13 11 FOL: Syntax of basic elements Constant symbols: 1, 5, A, B, USC, JPL, Alex, Manos, … Predicate symbols: >, Friend, Student, Colleague, … Function symbols: +, sqrt, SchoolOf, TeacherOf, ClassOf, … Variables: x, y, z, next, first, last, … Connectives: , , ,  Quantifiers: ,  Equality: =

12 CS 561, Session 12-13 12 FOL: Atomic sentences AtomicSentence  Predicate(Term, …) | Term = Term Term  Function(Term, …) | Constant | Variable Examples: SchoolOf(Manos) Colleague(TeacherOf(Alex), TeacherOf(Manos)) >((+ x y), x)

13 CS 561, Session 12-13 13 FOL: Complex sentences Sentence  AtomicSentence | Sentence Connective Sentence | Quantifier Variable, … Sentence |  Sentence | (Sentence) Examples: S1  S2, S1  S2, (S1  S2)  S3, S1  S2, S1  S3 Colleague(Paolo, Maja)  Colleague(Maja, Paolo) Student(Alex, Paolo)  Teacher(Paolo, Alex)

14 CS 561, Session 12-13 14 Semantics of atomic sentences Sentences in FOL are interpreted with respect to a model Model contains objects and relations among them Terms: refer to objects (e.g., Door, Alex, StudentOf(Paolo)) Constant symbols: refer to objects Predicate symbols: refer to relations Function symbols: refer to functional Relations An atomic sentence predicate(term 1, …, term n ) is true iff the relation referred to by predicate holds between the objects referred to by term 1, …, term n

15 CS 561, Session 12-13 15 Example model Objects: John, James, Marry, Alex, Dan, Joe, Anne, Rich Relation: sets of tuples of objects {,,, …} {,,, …} E.g.: Parent relation -- {,, } then Parent(John, James) is true Parent(John, Marry) is false

16 CS 561, Session 12-13 16 Quantifiers Expressing sentences of collection of objects without enumeration E.g., All Trojans are clever Someone in the class is sleeping Universal quantification (for all):  Existential quantification (three exists): 

17 CS 561, Session 12-13 17 Universal quantification (for all):   “Every one in the 561a class is smart”:  x In(561a, x)  Smart(x)  P corresponds to the conjunction of instantiations of P In(561a, Manos)  Smart(Manos)  In(561a, Dan)  Smart(Dan)  … In(561a, Clinton)  Smart(Clinton)  is a natural connective to use with  Common mistake: to use  in conjunction with  e.g:  x In(561a, x)  Smart(x) means “every one is in 561a and everyone is smart”

18 CS 561, Session 12-13 18 Existential quantification (there exists):   “Someone in the 561a class is smart”:  x In(561a, x)  Smart(x)  P corresponds to the disjunction of instantiations of P In(561a, Manos)  Smart(Manos)  In(561a, Dan)  Smart(Dan)  … In(561a, Clinton)  Smart(Clinton)  is a natural connective to use with  Common mistake: to use  in conjunction with  e.g:  x In(561a, x)  Smart(x) is true if there is anyone that is not in 561a! (remember, false  true is valid).

19 CS 561, Session 12-13 19 Properties of quantifiers

20 CS 561, Session 12-13 20 Example sentences Brothers are siblings. Sibling is transitive. One’s mother is one’s sibling’s mother. A first cousin is a child of a parent’s sibling.

21 CS 561, Session 12-13 21 Example sentences Brothers are siblings  x, y Brother(x, y)  Sibling(x, y) Sibling is transitive  x, y, z Sibling(x, y)  Sibling(y, z)  Sibling(x, z) One’s mother is one’s sibling’s mother  m, c Mother(m, c)  Sibling(c, d)  Mother(m, d) A first cousin is a child of a parent’s sibling  c, d FirstCousin(c, d)   p, ps Parent(p, d)  Sibling(p, ps)  Parent(ps, c)

22 CS 561, Session 12-13 22 Equality

23 CS 561, Session 12-13 23 Higher-order logic? First-order logic allows us to quantify over objects (= the first-order entities that exist in the world). Higher-order logic also allows quantification over relations and functions. e.g., “two objects are equal iff all properties applied to them are equivalent”:  x,y (x=y)  (  p, p(x)  p(y)) Higher-order logics are more expressive than first-order; however, so far we have little understanding on how to effectively reason with sentences in higher-order logic.

24 CS 561, Session 12-13 24 Logical agents for the Wumpus world 1.TELL KB what was perceived Uses a KRL to insert new sentences, representations of facts, into KB 2.ASK KB what to do. Uses logical reasoning to examine actions and select best. Remember: generic knowledge-based agent:

25 CS 561, Session 12-13 25 Using the FOL Knowledge Base

26 CS 561, Session 12-13 26 Wumpus world, FOL Knowledge Base

27 CS 561, Session 12-13 27 Deducing hidden properties

28 CS 561, Session 12-13 28 Situation calculus

29 CS 561, Session 12-13 29 Describing actions

30 CS 561, Session 12-13 30 Describing actions (cont’d)

31 CS 561, Session 12-13 31 Planning

32 CS 561, Session 12-13 32 Generating action sequences

33 CS 561, Session 12-13 33 Summary

Download ppt "CS 561, Session 12-13 1 Midterm format Date: 10/10/2002 from 11:00am – 12:20 pm Location: THH 101 Credits: 35% of overall grade Approx. 4 problems, several."

Similar presentations

First-Order Logic Chapter 8.

First-Order Logic Chapter 8.
March 2, 2006AI: Chapter 8: First-Order Logic1 Artificial Intelligence Chapter 8: First-Order Logic Michael Scherger Department of Computer Science Kent.

March 2, 2006AI: Chapter 8: First-Order Logic1 Artificial Intelligence Chapter 8: First-Order Logic Michael Scherger Department of Computer Science Kent.
First-Order Logic.

First-Order Logic.
First-Order Logic: Better choice for Wumpus World Propositional logic represents facts First-order logic gives us Objects Relations: how objects relate.

First-Order Logic: Better choice for Wumpus World Propositional logic represents facts First-order logic gives us Objects Relations: how objects relate.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.

Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Logic.

Logic.
SE 420 1 Last time: Logic and Reasoning Knowledge Base (KB): contains a set of sentences expressed using a knowledge representation language TELL: operator.

SE Last time: Logic and Reasoning Knowledge Base (KB): contains a set of sentences expressed using a knowledge representation language TELL: operator.
Chương 3 Tri thức và lập luận. Nội dung chính chương 3 I.Logic – ngôn ngữ của tư duy II.Logic mệnh đề (cú pháp, ngữ nghĩa, sức mạnh biểu diễn, các thuật.

Chương 3 Tri thức và lập luận. Nội dung chính chương 3 I.Logic – ngôn ngữ của tư duy II.Logic mệnh đề (cú pháp, ngữ nghĩa, sức mạnh biểu diễn, các thuật.
1 DCP 1172 Introduction to Artificial Intelligence Lecture notes for Ch.8 [AIAM-2nd Ed.] First-order Logic (FOL) Chang-Sheng Chen.

1 DCP 1172 Introduction to Artificial Intelligence Lecture notes for Ch.8 [AIAM-2nd Ed.] First-order Logic (FOL) Chang-Sheng Chen.
First-Order Logic. Limitations of propositional logic Suppose you want to say “All humans are mortal” –In propositional logic, you would need ~6.7 billion.

First-Order Logic. Limitations of propositional logic Suppose you want to say “All humans are mortal” –In propositional logic, you would need ~6.7 billion.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.

Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Logic. Propositional Logic Logic as a Knowledge Representation Language A Logic is a formal language, with precisely defined syntax and semantics, which.

Logic. Propositional Logic Logic as a Knowledge Representation Language A Logic is a formal language, with precisely defined syntax and semantics, which.
CS 561, Sessions 10-11 1 Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.

CS 561, Sessions Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.
CS 460, Session 12-13 1 Midterm format Date: 10/07/2004 from 5:00pm – 6:30pm Location: WPH B27 (our regular classroom) Credits: 30% of overall grade Approx.

CS 460, Session Midterm format Date: 10/07/2004 from 5:00pm – 6:30pm Location: WPH B27 (our regular classroom) Credits: 30% of overall grade Approx.
CS 460, Sessions 10-11 1 Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.

CS 460, Sessions Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.
Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, 9.1-9.2 First lecture slides read: 8.1-8.2 Second lecture slides read: 8.3-8.4.

Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, First lecture slides read: Second lecture slides read:
CS 561, Session 12-13 1 Last time: Logic and Reasoning Knowledge Base (KB): contains a set of sentences expressed using a knowledge representation language.

CS 561, Session Last time: Logic and Reasoning Knowledge Base (KB): contains a set of sentences expressed using a knowledge representation language.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.

Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.

Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
FIRST-ORDER LOGIC FOL or FOPC

FIRST-ORDER LOGIC FOL or FOPC

Similar presentations

Ads by Google