EA C461 – Artificial Intelligence Logical Agent

Slides:



Advertisements
Similar presentations
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Advertisements

Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
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.
Artificial Intelligence Knowledge-based Agents Russell and Norvig, Ch. 6, 7.
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.
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.
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.
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.
Methods of Proof Chapter 7, second half.
Logical Agents Chapter 7 Feb 26, Knowledge and Reasoning Knowledge of action outcome enables problem solving –a reflex agent can only find way from.
Agents that Reason Logically Logical agents have knowledge base, from which they draw conclusions TELL: provide new facts to agent ASK: decide on appropriate.
Logical Agents. Knowledge bases Knowledge base = set of sentences in a formal language Declarative approach to building an agent (or other system): 
CHAPTERS 7, 8 Oliver Schulte Logical Inference: Through Proof to Truth.
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 Logic Propositional Logic Summary
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
S P Vimal, Department of CSIS, BITS, Pilani
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 17, 2012.
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.
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.
1 The Wumpus Game StenchBreeze Stench Gold Breeze StenchBreeze Start  Breeze.
© Copyright 2008 STI INNSBRUCK Intelligent Systems 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.
Computing & Information Sciences Kansas State University Wednesday, 13 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 10 of 42 Wednesday, 13 September.
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,
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
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)
CS666 AI P. T. Chung Logic Logical Agents Chapter 7.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
ECE457 Applied Artificial Intelligence Fall 2007 Lecture #6
EA C461 Artificial Intelligence
Knowledge and reasoning – second part
EA C461 – Artificial Intelligence Logical Agent
Logical Inference 4 wrap up
EA C461 – Artificial Intelligence Logical Agent
Logical Agents Chapter 7.
Artificial Intelligence Logical Agents
Artificial Intelli-gence 1: logic agents
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
Logical Agents Chapter 7 Selected and slightly modified slides from
Logical Agents Chapter 7.
CSE 4705 Artificial Intelligence
Artificial Intelligence
Artificial Intelligence: Agents and Propositional Logic.
Artificial Intelligence: Logic agents
CS 416 Artificial Intelligence
Knowledge and reasoning – second part
Logical Agents Chapter 7.
Knowledge Representation I (Propositional Logic)
Methods of Proof Chapter 7, second half.
Problems in AI Problem Formulation Uninformed Search Heuristic Search
Logical Inference 4 wrap up
Logical Agents Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

EA C461 – Artificial Intelligence Logical Agent S.P.Vimal http://discovery.bits-pilani.ac.in/~vimalsp/1910AI/

To discuss… Propositional Inference in Wumpus World Circuit Based Agent Vimal EA C461- Artificial Intelligence

Wumpus World Let us look at sentences in the WW- KB The agent begins its exploration from a square known to be safe R1: P1,1 R2: W1,1 For every square [x,y], if the agent perceives breeze… R3 - R18: Bx,y  (Px,y+1  Px,y-1  Px+1,y  Px-1,y) Vimal EA C461- Artificial Intelligence

Wumpus World For every square [x,y], if the agent perceives stench… R19 – R34: Bx,y  (Px,y+1  Px,y-1  Px+1,y  Px-1,y) How do we express there is exactly one wumpus We can represent it 2 sentences There is at least one wumpus R35: W1,1  W1,2  …  W4,4 Vimal EA C461- Artificial Intelligence

Wumpus World We have used 64 distinct symbols in the KB For any two squares, one must be wumpus-free This should be stated for every pair of squares [n (n-1)] / 2 number of sentences R36 :W1,1  W1,2 R37 : W1,1  W1,3 … R155 : _________ We have used 64 distinct symbols in the KB Vimal EA C461- Artificial Intelligence

Wumpus World –Agent Program Additional Program Variables Vimal EA C461- Artificial Intelligence

Wumpus World –Agent Program ASK  Entailment computation TT-Entails -264 rows- DPLL / WALKSAT performs better For a large ww, the number of sentences in the KB will be huge WE could not capture the property “breeze in a square indicates pit in at least one of directly adjacent square” Can we keep track of location and orientation within the KB? Vimal EA C461- Artificial Intelligence

Location, Orientation in WW Can we add propositions like L1,1 Λ FacingRight Λ Forward  L2,1 KB will entail both L1,1 and L2,1. How??? What we intended to capture is this L1,1 (t) Λ FacingRight Λ Forward  L2,1(t+1) FacingRight Λ TurnLeft (t)  FacingUp(t+1) For every times steps, one such statements??? Assuming the problem is solvable in 100 time steps  10 thousands of additional sentences Vimal EA C461- Artificial Intelligence

Circuit Based Agents Reflex agent with state Percepts are inputs to sequential circuit Network of gates and registers Output are registers corresponding to actions Circuits are evaluated in a dataflow model Value stored at each proposition symbol gives the truth value of the corresponding symbol at the current time t. Vimal EA C461- Artificial Intelligence

Circuit Based Agents Vimal EA C461- Artificial Intelligence

Circuit Based Agents Vimal EA C461- Artificial Intelligence

Circuit Based Agents… Location??? One register for each Lxy. Agent is in [1,1] at t if The agent was in [1,1] at t-1 and has no moved, tried but bump It was at [1,2], facing down and moved forward It was at [2,1] facing left and move forward Vimal EA C461- Artificial Intelligence

Circuit Based Agents… Location??? Vimal EA C461- Artificial Intelligence

Circuit Based Agents… a problem What will be the initial truth value contained in B4,4 The agent cannot set a truth value for it Need to represent unknown Use knowledge propositions K(B4,4) , K(רB4,4) Vimal EA C461- Artificial Intelligence

Inference based agents vs. Circuit based Agents Declarative vs. Procedural Conciseness Computational Efficiency Completeness Vimal EA C461- Artificial Intelligence

Summary Logical agents apply inference to a knowledge base to derive new information and make decisions Basic concepts of logic: syntax: formal structure of sentences semantics: truth of sentences wrt models entailment: necessary truth of one sentence given another inference: deriving sentences from other sentences soundness: derivations produce only entailed sentences completeness: derivations can produce all entailed sentences Wumpus world requires the ability to represent partial and negated information, reason by cases, etc. Resolution is complete for propositional logic Forward, backward chaining are linear-time, complete for Horn clauses Propositional logic lacks expressive power Vimal EA C461- Artificial Intelligence