EA C461 Artificial Intelligence

Slides:



Advertisements
Similar presentations
Russell and Norvig Chapter 7
Advertisements

Inference Rules Universal Instantiation Existential Generalization
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.
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Logic.
Knowledge and reasoning – second part
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.
ITCS 3153 Artificial Intelligence Lecture 11 Logical Agents Chapter 7 Lecture 11 Logical Agents Chapter 7.
Logical Agents Chapter 7.
Methods of Proof Chapter 7, second half.
INTRODUÇÃO AOS SISTEMAS INTELIGENTES Prof. Dr. Celso A.A. Kaestner PPGEE-CP / UTFPR Agosto de 2011.
Knoweldge Representation & Reasoning
Knowledge Representation & Reasoning (Part 1) Propositional Logic chapter 5 Dr Souham Meshoul CAP492.
Rutgers CS440, Fall 2003 Propositional Logic Reading: Ch. 7, AIMA 2 nd Ed. (skip )
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
Logical Agents. Knowledge bases Knowledge base = set of sentences in a formal language Declarative approach to building an agent (or other system): 
February 20, 2006AI: Chapter 7: Logical Agents1 Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent.
Propositional Logic: Methods of Proof (Part II)
Logical Agents (NUS) Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
Logical Inference 2 rule based reasoning
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,
1 Problems in AI Problem Formulation Uninformed Search Heuristic Search Adversarial Search (Multi-agents) Knowledge RepresentationKnowledge Representation.
Propositional Logic: Methods of Proof (Part II) This lecture topic: Propositional Logic (two lectures) Chapter (previous lecture, Part I) Chapter.
An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati
S P Vimal, Department of CSIS, BITS, Pilani
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.
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.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional 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.
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 Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Logical Agents Russell & Norvig Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean)
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,
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,
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
Notes 7: Knowledge Representation, The Propositional Calculus
Logical Inference 2 Rule-based reasoning
Announcements No office hours today!
EA C461 – Artificial Intelligence Logical Agent
Artificial Intelligence Logical Agents
Notes 7: Knowledge Representation, The Propositional Calculus
Logical Inference 2 Rule-based reasoning
Logical Inference: Through Proof to Truth
Logical Agents Chapter 7.
Artificial Intelligence Logical Agents
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
Logical Agents Chapter 7 Selected and slightly modified slides from
Logical Agents Reading: Russell’s Chapter 7
Logical Agents.
Artificial Intelligence
Artificial Intelligence: Agents and Propositional Logic.
CS 416 Artificial Intelligence
Automated Reasoning in Propositional Logic
Logical Agents Chapter 7 How do we reason about reasonable decisions
Methods of Proof Chapter 7, second half.
Propositional Logic: Methods of Proof (Part II)
Problems in AI Problem Formulation Uninformed Search Heuristic Search
LECTURE 06 Logical Agent Course : T0264 – Artificial Intelligence
Presentation transcript:

EA C461 Artificial Intelligence Logical Agent S.P.Vimal BITS-Pilani EA C461 Artificial Intelligence

EA C461 Artificial Intelligence To discuss Reasoning Patterns Modus Ponens, AND Elimination Inference Based on Resolution Forward Chaining, Backward Chaining EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Reasoning Patterns Modus Ponens Given α β, α the sentence β can be inferred And Elimination Given α Λ β, α the sentence β can be inferred Sound inferences can be generated EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Reasoning Patterns R1:  P1,1 R2: B1,1 R3: B2,1 R4: B1,1  (P1,2  P2,1) R5: B2,1  (P1,1  P2,2  P3,1) The KB is now R1Λ R2Λ R3Λ R4Λ R5 How do you infer there is no pit in (1,2) . That is ( P1,2).. Sequence of derivations (proof) will help us conclude ( P1,2) Finding proof is similar to searching Trying to find a proof Vs Truth Table Enumeration EA C461 Artificial Intelligence

Resolution Conjunctive Normal Form (CNF) conjunction of disjunctions of literals clauses E.g., (A  B)  (B  C  D) Resolution inference rule (for CNF): li …  lk, m1  …  mn li  …  li-1  li+1  …  lk  m1  …  mj-1  mj+1 ...  mn where li and mj are complementary literals. E.g., P1,3  P2,2, P2,2 P1,3 Resolution is sound and complete for propositional logic EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Resolution algorithm Inference based on resolution Proof by contradiction, i.e., show KBα unsatisfiable EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Resolution example KB = (B1,1  (P1,2 P2,1))  B1,1 α = P1,2 EA C461 Artificial Intelligence

Resolution Closure--RC(S) Set of all clauses derivable by repeated application of the resolution rule to clauses in S and their derivables Ground Resolution Theorem If a set of clauses are unsatisfiable, then their RC will contain an empty clause Any complete search algorithm , applying only resolution rule can derive any conclusions entailed by any knowledge base in propositional logic Refutation Completeness Resolution can always be used to confirm or refute a sentence. EA C461 Artificial Intelligence

Forward and backward chaining Horn Form (restricted) KB = conjunction of Horn clauses Horn clause = proposition symbol; or (conjunction of symbols)  symbol E.g., C  (B  A)  (C  D  B) Modus Ponens (for Horn Form): complete for Horn KBs α1, … ,αn, α1  …  αn  β β Can be used with forward chaining or backward chaining. These algorithms are very natural and run in linear time EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Forward chaining Idea: fire any rule whose premises are satisfied in the KB, add its conclusion to the KB, until query is found EA C461 Artificial Intelligence

Forward chaining algorithm Forward chaining is sound and complete for Horn KB EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

Forward chaining example EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Proof of completeness FC derives every atomic sentence that is entailed by KB FC reaches a fixed point where no new atomic sentences are derived Consider the final state as a model m, assigning true/false to symbols Every clause in the original KB is true in m a1  …  ak  b Hence m is a model of KB If KB╞ q, q is true in every model of KB, including m EA C461 Artificial Intelligence

EA C461 Artificial Intelligence Backward chaining Idea: work backwards from the query q: to prove q by BC, check if q is known already, or prove by BC all premises of some rule concluding q Avoid loops: check if new subgoal is already on the goal stack Avoid repeated work: check if new subgoal has already been proved true, or has already failed EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Backward chaining example EA C461 Artificial Intelligence

Forward vs. backward chaining FC is data-driven, automatic, unconscious processing, e.g., object recognition, routine decisions May do lots of work that is irrelevant to the goal BC is goal-driven, appropriate for problem-solving, e.g., Where are my keys? How do I get into a PhD program? Complexity of BC can be much less than linear in size of KB EA C461 Artificial Intelligence