Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 22 September.

Slides:



Advertisements
Similar presentations
Russell and Norvig Chapter 7
Advertisements

Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Computing & Information Sciences Kansas State University Lecture 16 of 42 CIS 530 / 730 Artificial Intelligence Lecture 16 of 42 Knowledge Engineering.
Artificial Intelligence Knowledge-based Agents Russell and Norvig, Ch. 6, 7.
Knowledge Representation & Reasoning.  Introduction How can we formalize our knowledge about the world so that:  We can reason about it?  We can do.
1 Problem Solving CS 331 Dr M M Awais Representational Methods Formal Methods Propositional Logic Predicate Logic.
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.
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.
INTRODUÇÃO AOS SISTEMAS INTELIGENTES Prof. Dr. Celso A.A. Kaestner PPGEE-CP / UTFPR Agosto de 2011.
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 )
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): 
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.
Computing & Information Sciences Kansas State University Lecture 10 of 42 CIS 530 / 730 Artificial Intelligence Lecture 10 of 42 William H. Hsu Department.
‘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.
Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part A Knowledge Representation and Reasoning.
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,
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 16 Monday, 29 September.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 11 of 41 Wednesday, 15.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 17 Wednesday, 01 October.
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.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 12 Friday, 17 September.
Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.
Computing & Information Sciences Kansas State University Monday, 25 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 14 of 42 Monday, 25 September.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 23 Friday, 17 October.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 14 of 41 Wednesday, 22.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 15 of 41 Friday 24 September.
Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Lecture 15 of 42 William H. Hsu Department.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 18 of 41 Friday, 01 October.
1 The Wumpus Game StenchBreeze Stench Gold Breeze StenchBreeze Start  Breeze.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 13 –Reasoning with Uncertainty Tuesday –AIMA, Ch. 14.
Computing & Information Sciences Kansas State University Wednesday, 19 Sep 2007CIS 530 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 19 September.
Computing & Information Sciences Kansas State University Monday, 23 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 25 of 42 Monday, 23 October.
Computing & Information Sciences Kansas State University Friday, 20 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 24 of 42 Friday, 20 October.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
Computing & Information Sciences Kansas State University Wednesday, 13 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 10 of 42 Wednesday, 13 September.
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,
Computing & Information Sciences Kansas State University CIS 530 / 730: Artificial Intelligence Lecture 09 of 42 Wednesday, 17 September 2008 William H.
Computing & Information Sciences Kansas State University Monday, 09 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 19 of 42 Monday, 09 October.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 14 of 42 Wednesday, 22.
Logical Agents Chapter 7 Part I. 2 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
Computing & Information Sciences Kansas State University Friday, 03 Oct 2008CIS 530 / 730: Artificial Intelligence Lecture 16 of 42 Friday, 03 October.
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)
EA C461 – Artificial Intelligence Logical Agent
Logical Agents Reading: Russell’s Chapter 7
Logical Agents Chapter 7.
Artificial Intelligence
Logical Agents Chapter 7.
Knowledge Representation I (Propositional Logic)
Presentation transcript:

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 22 September 2008 William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: Course web site: Instructor home page: Reading for Next Class: Section 8.1 – 8.2, p. 240 – 253, Russell & Norvig 2 nd edition First-Order Logic: Syntax and Semantics Discussion: Role of Logic in Planning

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Wumpus World: PEAS Description Performance measure  gold +1000, death  -1 per step, -10 for using the arrow Environment  Squares adjacent to wumpus are smelly  Squares adjacent to pit are breezy  Glitter iff gold is in the same square  Shooting kills wumpus if you are facing it  Shooting uses up the only arrow  Grabbing picks up gold if in same square  Releasing drops the gold in same square Sensors: Stench, Breeze, Glitter, Bump, Scream Actuators: Left turn, Right turn, Forward, Grab, Release, Shoot © 2004 S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Wumpus World: Characterization Fully Observable No – only local perception Deterministic Yes – outcomes exactly specified Episodic No – sequential at the level of actions Static Yes – Wumpus and Pits do not move Discrete Yes Single-agent? Yes – Wumpus is essentially a natural feature © 2004 S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Fun with Sentences: Family Feud Brothers are Siblings   x, y. Brother (x, y)  Sibling (x, y) Siblings (i.e., Sibling Relationships) are Reflexive   x, y. Sibling (x, y)  Sibling (y, x) One’s Mother is One’s Female Parent   x, y. Mother (x, y)  Female (x)  Parent (x, y) A First Cousin Is A Child of A Parent’s Sibling   x, y. First-Cousin (x, y)   p, ps. Parent (p, x)  Sibling (p, ps)  Parent (ps, y) Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence “Every Dog Chases Its Own Tail”   d. Chases (d, tail-of (d))  Alternative Statement:  d.  t. Tail-Of (t, d)  Chases (d, t)  Prefigures concept of Skolemization (Skolem variables / functions) “Every Dog Chases Its Own (Unique) Tail”   d.  1 t. Tail-Of (t, d)  Chases (d, t)   d.  t. Tail-Of (t, d)  Chases (d, t)  [  t’ Chases (d, t’)  t’ = t] “Only The Wicked Flee when No One Pursueth”   x. Flees (x)  [¬  y Pursues (y, x)]  Wicked (x)  Alternative :  x. [  y. Flees (x, y)]  [¬  z. Pursues (z, x)]  Wicked (x) Offline Exercise: What Is An nth Cousin, m Times Removed? Exercise: First-Order Logic Sentences

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Validity and Satisfiability Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence FOL: Atomic Sentences (Atomic Well-Formed Formulae) Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence FOL: Complex Sentences (Well-Formed Formulae) Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Truth in FOL Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Lecture Outline Reading for Next Class: Section 8.1 – 8.2, R&N 2e Recommended : Nilsson and Genesereth (Chapter 5 online) Next Week’s: Chapter 8 & first half of Chapter 9, R&N Today  Syntax of first-order predicate calculus (FOPC, aka “first-order logic”)  Semantics  Role of automated deduction in AI This Week  Monday: Propositional Resolution, Soundness, Completness  Today: First-order logic (FOL): predicates, functions, quantifiers  Friday: Knowledge Engineering (KE) and theorem proving Coming Soon  Next week: Resolution, constraint logic, Prolog  Week of 04 Oct 2006: knowledge representation, ontologies

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Taking Stock: FOL Inference Previously: Logical Agents and Calculi FOL in Practice  Agent “toy” world: Wumpus World in FOL  Situation calculus  Frame problem and variants (see R&N sidebar)  Representational vs. inferential frame problems  Qualification problem: “what if?”  Ramification problem: “what else?” (side effects)  Successor-state axioms FOL Knowledge Bases FOL Inference  Proofs  Pattern-matching: unification  Theorem-proving as search  Generalized Modus Ponens (GMP)  Forward Chaining and Backward Chaining

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Automated Deduction (Chapters 8-10 R&N) Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Apply Sequent Rules to Generate New Assertions Modus Ponens And Introduction Universal Elimination Example Proof Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence A Brief History of Reasoning: Chapter 8 End Notes, R&N Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Unification: Definitions and Idea Sketch Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Generalized Modus Ponens Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Forward Chaining Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Example: Forward Chaining Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Backward Chaining Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Example: Backward Chaining Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Question: How Does This Relate to Proof by Refutation? Answer  Suppose ¬Query, For The Sake Of Contradiction (FTSOC)  Attempt to prove that KB  ¬Query |=  Review: Backward Chaining Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Resolution Inference Rule Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Completeness Redux Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Completeness in FOL Adapted from slides by S. Russell, UC Berkeley

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Adapted from slides by S. Russell, UC Berkeley Logical Agents: Review

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Digression: Decidability and Formal Languages See: Hopcroft and Ullman 2e, Lewis and Papadimitriou 3e Formal Languages (See: CIS 540, Other Automata Theory Course)  Member of Turing hierarchy  Finite state automata: regular languages  Pushdown automata: context-free languages  Linear bounded automata: context-sensitive languages  Turing machines: recursive languages  Recursive languages   computational model for decision problem, halts in finite number of steps  REC: set of all recursive languages  Example: finite searches (convert to decision problem of checking solution)  Closed under complementation (consequence?)  Recursive enumerable but not recursive (RE - REC)  Not recursive (  RE) What Are FOL-VALID, FOL-NOT-SAT, FOL-SAT, FOL-NOT-VALID?

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Summary Points Applications of Knowledge Bases (KBs) and Inference Systems “Industrial Strength” KBs  Building KBs  Components  Ontologies  Fact and rule bases  Knowledge Engineering (KE) and protocol analysis  Inductive Logic Programming (ILP) and other machine learning techniques  Using KBs Systems of Sequent Rules: GMP/AI/UE, Resolution Methodology of Inference  Inference as search  Forward and backward chaining  Fan-in, fan-out

Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Terminology Logical Frameworks  Knowledge Bases (KB)  Logic in general: representation languages, syntax, semantics  Propositional logic  First-order logic (FOL, FOPC)  Model theory, domain theory: possible worlds semantics, entailment Normal Forms  Conjunctive Normal Form (CNF)  Disjunctive Normal Form (DNF)  Horn Form Proof Theory and Inference Systems  Sequent calculi: rules of proof theory  Derivability or provability  Properties  Soundness (derivability implies entailment)  Completeness (entailment implies derivability)