Knowledge Representation Use of logic. Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally.

Slides:



Advertisements
Similar presentations
Artificial Intelligence Chapter 13 The Propositional Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Advertisements

UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Logic.
Logic Concepts Lecture Module 11.
Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.
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.
ITCS 3153 Artificial Intelligence Lecture 11 Logical Agents Chapter 7 Lecture 11 Logical Agents Chapter 7.
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.
Knowledge Representation I (Propositional Logic) CSE 473.
Knowledge in intelligent systems So far, we’ve used relatively specialized, naïve agents. How can we build agents that incorporate knowledge and a memory?
Knoweldge Representation & Reasoning
CS 4700: Foundations of Artificial Intelligence
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.
CSM6120 Introduction to Intelligent Systems Propositional and Predicate Logic.
I NTRO TO L OGIC Dr Shlomo Hershkop March
Inference is a process of building a proof of a sentence, or put it differently inference is an implementation of the entailment relation between sentences.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
February 20, 2006AI: Chapter 7: Logical Agents1 Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent.
Fall 98 Introduction to Artificial Intelligence LECTURE 7: Knowledge Representation and Logic Motivation Knowledge bases and inferences Logic as a representation.
Pattern-directed inference systems
Logical Agents Logic Propositional Logic Summary
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati
S P Vimal, Department of CSIS, BITS, Pilani
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
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 Chapter 7. 2 A simple knowledge-based agent The agent must be able to: –Represent states, actions, etc. –Incorporate new percepts –Update.
LECTURE LECTURE Propositional Logic Syntax 1 Source: MIT OpenCourseWare.
9/30/98 Prof. Richard Fikes Inference In First Order Logic Computer Science Department Stanford University CS222 Fall 1998.
October 17, 2012Introduction to Artificial Intelligence Lecture 11: Knowledge Representation and Reasoning I 1Semantics In propositional logic, we associate.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
1 Logical Inference Algorithms CS 171/271 (Chapter 7, continued) Some text and images in these slides were drawn from Russel & Norvig’s published material.
CS6133 Software Specification and Verification
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
Reasoning with Propositional Logic automated processing of a simple knowledge base CD.
Automated Reasoning in Propositional Logic Problem Given: KB: a set of sentence  : a sentence Answer: KB  ?
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part B Propositional Logic.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Logical Agents Chapter 7 Part I. 2 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
Automated Reasoning in Propositional Logic Russell and Norvig: Chapters 6 and 9 Chapter 7, Sections 7.5—7.6 CS121 – Winter 2003.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Logical Agents. Inference : Example 1 How many variables? 3 variables A,B,C How many models? 2 3 = 8 models.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
EA C461 Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence
Knowledge Representation and Reasoning
The Propositional Calculus
EA C461 – Artificial Intelligence Logical Agent
Logical Inference: Through Proof to Truth
Artificial Intelligence
Artificial Intelligence: Agents and Propositional Logic.
CS 416 Artificial Intelligence
Back to “Serious” Topics…
Automated Reasoning in Propositional Logic
Presentation transcript:

Knowledge Representation Use of logic

Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally Logic primary vehicle K always definite ( T/F)

Problem for a robot If red light is ON or it is morning shift or supervisor absent then door is locked. If door is locked it implies that the red light is turned ON or it is morning shift or the supervisor is absent If load is small in size or load is light then the conveyor belt moves If the conveyor belt is moving then it means the load has a small size or load is light The Red light is off, the Conveyor belt is not moving and the Door is locked. The robot wants to know if the load is heavy (not light).

Robot needs a Knowledge Base and reasoning ability

Knowledge base Central component of a K based agent Set of sentences INFERENCE – Deriving new info from old Language to enable building KB

Interpretations Language semantics defines TRUTH of each sentence w.r.t. each possible world

Similarity with CSP Constraint solving is a form of Logical reasoning Constraint languages: LOGICS

Wff and logical reasoning Entailment: – Sentence follows logically from another sentence KB |= s iff in every model in which KB is true, s is also true

Inference algorithm Enumerate the models Check if s is true in every model (interpretation) for which KB is also true Backtracking search – recursively assign values to variables Exponential complexity

definitions Validity Tautology Deduction theorem Satisfiability inconsistancy

Reasoning patterns in Propositional logic

Inference rules Modus Ponens And Elimination Standard logical equivalances – De Morgan – Contra positive – Distributive laws – Associative laws

Deduction With the knowledge base that the robot has, and what it currently perceives (more knowledge added to the KB), the robot wants to deduce that the load is not light

Knowledge that robot has If red light is ON or it is morning shift or supervisor absent then door is locked. If door is locked it implies that the red light is turned ON or it is morning shift or the supervisor is absent If load is small in size or load is light then the conveyor belt moves If the conveyor belt is moving then it means the load has a small size or load is light

Observations by the robot Red light is off Conveyor belt is not moving Door is locked

What the robot wants to establish? The load is not light ( or in other words it is heavy)

Knowledge + Observation (K.B.) If red light is ON or it is morning shift or supervisor absent then door is locked. If door is locked it implies that the red light is turned ON or it is morning shift or the supervisor is absent If load is small in size or load is light then the conveyor belt moves If the conveyor belt is moving then it means the load has a small size or load is light Red light is off Conveyor belt is not moving Door is locked

Propositions P: red light is ON M: it is morning shift N: supervisor absent D: door is locked. Q: load is small in size R: load is light B: the conveyor belt is moving

Next? Now generate wffs and start the inference process

Steps to help the robot (inferencing) Consider a relevant rule for conveyor belt Use And-elimination Use contra-positive relation Use modus ponens Use de morgan’s law

PROOF? PROOF: Sequence of application of Inference rules. Finding proofs is like finding solutions to search problems. Successor function generates all possible application of inference rules In worst case, search for proof would be as bad as enumerating all the models Some irrelevant propositions can be ignored to speed up search.

Monotonicity Set of entailed sentences can only increase as info is added to KB. Rules can be applied wherever suitable

Resolution What about completeness? Can everything be inferred? Resolution rule forms basis for a family of complete inference procedures.

Refutation completeness Resolution can be used to either CONFIRM or REFUTE a sentence

Artificial Intelligence

Intelligent?

What is intelligence? computational part of the ability to achieve goals in the world