Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part A Knowledge Representation and Reasoning.

Slides:



Advertisements
Similar presentations
Russell and Norvig Chapter 7
Advertisements

Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Artificial Intelligence Knowledge-based Agents Russell and Norvig, Ch. 6, 7.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Logical Agents Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Fall 2005.
Knowledge Representation & Reasoning.  Introduction How can we formalize our knowledge about the world so that:  We can reason about it?  We can do.
Class Project Due at end of finals week Essentially anything you want, so long as its AI related and I approve Any programming language you want In pairs.
1 Problem Solving CS 331 Dr M M Awais Representational Methods Formal Methods Propositional Logic Predicate Logic.
CS 460, Sessions Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
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.
Computing & Information Sciences Kansas State University Lecture 11 of 42 CIS 530 / 730 Artificial Intelligence Lecture 11 of 42 William H. Hsu Department.
Knowledge Representation & Reasoning (Part 1) Propositional Logic chapter 6 Dr Souham Meshoul CAP492.
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.
Carla P. Gomes CS4700 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Module: Intro to Logic (Reading R&N: Chapter.
LOGICAL AGENTS Yılmaz KILIÇASLAN. Definitions Logical agents are those that can:  form representations of the world,  use a process of inference to.
Knowledge Representation & Reasoning (Part 1) Propositional Logic chapter 5 Dr Souham Meshoul CAP492.
Logical Agents Chapter 7 Feb 26, Knowledge and Reasoning Knowledge of action outcome enables problem solving –a reflex agent can only find way from.
Logical Agents Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2005.
Logical Agents Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2008.
Rutgers CS440, Fall 2003 Propositional Logic Reading: Ch. 7, AIMA 2 nd Ed. (skip )
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter (this lecture, Part I) Chapter 7.5.
Logical Agents Chapter 7 (based on slides from Stuart Russell and Hwee Tou Ng)
Logical Agents. Knowledge bases Knowledge base = set of sentences in a formal language Declarative approach to building an agent (or other system): 
Artificial Intelligence Lecture No. 9 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
February 20, 2006AI: Chapter 7: Logical Agents1 Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent.
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter (this lecture, Part I) Chapter 7.5.
‘In which we introduce a logic that is sufficent for building knowledge- based agents!’
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
Class Project Due at end of finals week Essentially anything you want, so long as its AI related and I approve Any programming language you want In pairs.
An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 17, 2012.
1 Knowledge Representation Propositional Logic Vumpus World Knowledge Representation Propositional Logic Vumpus World.
Logical Agents Chapter 7. Knowledge bases Knowledge base (KB): set of sentences in a formal language Inference: deriving new sentences from the KB. E.g.:
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
1 Logical Agents Chapter 7. 2 A simple knowledge-based agent The agent must be able to: –Represent states, actions, etc. –Incorporate new percepts –Update.
Knowledge Representation Lecture # 17, 18 & 19. Motivation (1) Up to now, we concentrated on search methods in worlds that can be relatively easily represented.
For Friday Read chapter 8 Homework: –Chapter 7, exercise 1.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 13 –Reasoning with Uncertainty Tuesday –AIMA, Ch. 14.
Wumpus World 1 Wumpus and 1 pile of gold in a pit-filled cave Starts in [1,1] facing right - Random cave Percepts: [smell, breeze, gold, bump, scream]
Computing & Information Sciences Kansas State University Wednesday, 13 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 10 of 42 Wednesday, 13 September.
Logical Agents Russell & Norvig Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean)
1 UNIT-3 KNOWLEDGE REPRESENTATION. 2 Agents that reason logically(Logical agents) A Knowledge based Agent The Wumpus world environment Representation,
Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
Logical Agents Chapter 7 Part I. 2 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic.
1 Knowledge Representation Logic and Inference Propositional Logic Vumpus World Knowledge Representation Logic and Inference Propositional Logic Vumpus.
Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
Artificial Intelligence Logical Agents Chapter 7.
Logical Agents. Inference : Example 1 How many variables? 3 variables A,B,C How many models? 2 3 = 8 models.
LOGICAL AGENTS CHAPTER 7 AIMA 3. OUTLINE  Knowledge-based agents  Wumpus world  Logic in general - models and entailment  Propositional (Boolean)
Propositional Logic: Logical Agents (Part I)
Knowledge and reasoning – second part
EA C461 – Artificial Intelligence Logical Agent
Artificial Intelli-gence 1: logic agents
Logical Agents Chapter 7 Selected and slightly modified slides from
Logical Agents Reading: Russell’s Chapter 7
Logical Agents Chapter 7.
Artificial Intelligence
Artificial Intelligence: Logic agents
Knowledge and reasoning – second part
Logical Agents Chapter 7.
CS 416 Artificial Intelligence
Knowledge Representation I (Propositional Logic)
Logical Agents Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part A Knowledge Representation and Reasoning

Knowledge Representation & Reasoning  Introduction How can we formalize our knowledge about the world so that:  We can reason about it?  We can do sound inference?  We can prove things?  We can plan actions?  We can understand and explain things?

Knowledge Representation & Reasoning  Introduction Objectives of knowledge representation and reasoning are: form representations of the world. use a process of inference to derive new representations about the world. use these new representations to deduce what to do.

Knowledge Representation & Reasoning  Introduction Some definitions:  Knowledge base: set of sentences. Each sentence is expressed in a language called a knowledge representation language.  Sentence: a sentence represents some assertion about the world.  Inference: Process of deriving new sentences from old ones.

Knowledge Representation & Reasoning  Introduction  Declarative vs procedural approach: Declarative approach is an approach to system building that consists in expressing the knowledge of the environment in the form of sentences using a representation language. Procedural approach encodes desired behaviors directly as a program code.

Knoweldge Representation & Reasoning  Example: Wumpus world THE WUMPUS

Knoweldge Representation & Reasoning Environment Squares adjacent to wumpus are smelly. Squares adjacent to pit are breezy. Glitter if and only if gold is in the same square. Shooting kills the wumpus if you are facing it. Shooting uses up the only arrow. Grabbing picks up the gold if in the same square. Releasing drops the gold in the same square. Goals: Get gold back to the start without entering in pit or wumpus square. Percepts: Breeze, Glitter, Smell. Actions: Left turn, Right turn, Forward, Grab, Release, Shoot.

Knoweldge Representation & Reasoning  The Wumpus world Is the world deterministic? Yes: outcomes are exactly specified. Is the world fully accessible? No: only local perception of square you are in. Is the world static? Yes: Wumpus and Pits do not move. Is the world discrete? Yes.

Exploring a wumpus world

If the Wumpus were here, stench should be here. Therefore it is here. Since, there is no breeze here, the pit must be there

Exploring a wumpus world

Knoweldge Representation & Reasoning Fundamental property of logical reasoning: In each case where the a conclusion is drawn from the available information, that conclusion is guaranteed to be correct if the available information is correct.

Fundamental concepts of logical representation Knoweldge Representation & Reasoning

Fundamental concepts of logical representation Logics are formal languages for representing information such that conclusions can be drawn. Each sentence is defined by a syntax and a semantic. Syntax defines the sentences in the language. It specifies well formed sentences. Semantics define the ``meaning'' of sentences; truth of a sentence i.e., in logic it defines the truth of a sentence in a possible world.

Knoweldge Representation & Reasoning Fundamental concepts of logical representation For example, the language of arithmetic  x + 2  y is a sentence.  x + y > is not a sentence.  x + 2  y is true iff the number x+2 is not less than the number y.  x + 2  y is true in a world where x = 7, y =1.  x + 2  y is false in a world where x = 0, y= 6.

Fundamental concepts of logical representation Model: This word is used instead of “possible world” for sake of precision. m is a model of a sentence α means α is true in model m Definition: A model is a mathematical abstraction that simply fixes the truth or falsehood of every relevant sentence. Knoweldge Representation & Reasoning

Fundamental concepts of logical representation m is a model of a sentence α means α is true in model m Example: x number of men and y number of women sitting at a table playing bridge. x+ y = 4 is a sentence which is true when the total number is four. Model : possible assignment of numbers to the variables x and y. Each assignment fixes the truth of any sentence whose variables are x and y. Model for x+y=4: (x, y) = {(0,4),(4,0),(3,1),(1,3),(2,2)} Knoweldge Representation & Reasoning

Entailment: Logical reasoning requires the relation of logical entailment between sentences: « a sentence follows logically from another sentence ». Mathematical notation: α ╞ β ( α entails the sentence β ) Formal definition: α ╞ β if and only if in every model in which α is true, β is also true. (truth of β is contained in the truth of α ). Fundamental concepts of logical representation Knoweldge Representation & Reasoning

Entailment Logical Representation World Sentences KB Facts Semantics Sentences  Semantics Facts Follows Entail Logical reasoning should ensure that the new configurations represent aspects of the world that actually follow from the aspects that the old configurations represent. Fundamental concepts of logical representation

Knoweldge Representation & Reasoning Model cheking: Enumerates all possible models to check that α is true in all models in which KB is true. Mathematical notation: KB α The notation says:  α is derived from KB by i  or i derives α from KB.  i is an inference algorithm. Fundamental concepts of logical representation i

Knoweldge Representation & Reasoning Fundamental concepts of logical representation An inference procedure can do two things:  Given KB, generate new sentence  purported to be entailed by KB.  Given KB and , report whether or not  is entailed by KB. Sound or truth preserving: inference algorithm that derives only entailed sentences. Completeness: an inference algorithm is complete, if it can derive any sentence that is entailed.

Knoweldge Representation & Reasoning Explaining more Soundness and completeness Soundness: if the system proves that something is true, then it is really true. The system doesn’t derive contradictions Completeness: if something is really true, it can be proven using the system. The system can be used to derive all the true mathematical statements one by one