CSE391-2005LOGIC1 Propositional Logic An “adventure game” example Thinking?

Slides:



Advertisements
Similar presentations
Russell and Norvig Chapter 7
Advertisements

Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Logic Use mathematical deduction to derive new knowledge.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Resolution Theorem Proving
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.
RESOLUTION: A COMPLETE INFERENCE PROCEDURE. I Then we certainly want to be able to conclude S(A); S(A) is true if S(A) or R(A) is true, and one of those.
Knowledge Representation I Suppose I tell you the following... The Duck-Bill Platypus and the Echidna are the only two mammals that lay eggs. Only birds.
3/30/00 Agents that Reason Logically by Chris Horn Jiansui Yang Xiaojing Wu.
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.
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.
Cooperating Intelligent Systems Logical agents Chapter 7, AIMA This presentation owes some to V. Rutgers and D. OSU.
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?
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 8 Jim Martin.
Methods of Proof Chapter 7, second half.
Cooperating Intelligent Systems Logical agents Chapter 7, AIMA This presentation owes some to V. Rutgers and D. OSU.
Knoweldge Representation & Reasoning
Artificial Intelligence
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 )
Agents that Reason Logically Logical agents have knowledge base, from which they draw conclusions TELL: provide new facts to agent ASK: decide on appropriate.
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.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 19, 2012.
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,
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
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM]
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.
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.
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
1 The Wumpus Game StenchBreeze Stench Gold Breeze StenchBreeze Start  Breeze.
Reasoning with Propositional Logic automated processing of a simple knowledge base CD.
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 Part I. 2 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic.
Ch. 7 – Logical Agents Supplemental slides for CSE 327 Prof. Jeff Heflin.
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)
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Knowledge and reasoning – second part
Introduction to Knowledge-bases
EA C461 – Artificial Intelligence Logical Agent
Logical Agents Chapter 7 Selected and slightly modified slides from
Logical Agents Reading: Russell’s Chapter 7
Logical Agents Chapter 7.
Knowledge and reasoning – second part
EA C461 – Artificial Intelligence Logical Agent
Logical Agents Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

CSE LOGIC1 Propositional Logic An “adventure game” example Thinking?

CSE LOGIC2 PSSS The Physical Symbol System Hypothesis: A physical symbol system has the necessary and sufficient means for general intelligent action. Where a symbol is a designating pattern that can be combined with others to form another designating pattern.

CSE LOGIC3 Knowledge Representation Key is problem formulation – –What happens when an n-dimensional array is insufficient? Need a language that is –Expressive and concise –Unambiguous and independent of context –Has an inference procedure for new sentences

CSE LOGIC4 Inference Rules And Elimination  1   2, ...   n  1 And Introduction  1,...,  n  1   2, ...   n

CSE LOGIC5 Inference Rules (cont’d) Or Introduction  i  1   2, ...   i  …   n Double Negation Elimination  

CSE LOGIC6 Inference Rules (cont’d) Modus Ponens (Implication Elimination) ,   (Chaining) ,    

CSE LOGIC7 Inference Rules (cont’d) Unit Resolution: ,   (cf.Modus Ponens) Resolution: ,    is true or false. If  is true,  is true. If  is false,  is true.

CSE LOGIC8 The Lion World Percepts: [Stench, Breeze, Glitter, Bump, Scream] Operators: [Right 90, Left 90, Forward, Grab, Shoot,Climb]

CSE LOGIC9 The Lion World (1,1) [none,none,none,none,none] A ok

CSE LOGIC10 The Lion World (1,1) [none,none,none,none,none] (2,1) [none,breeze,none,none,none] ok B P? A

CSE LOGIC11 The Lion World (1,1) [none,none,none,none,none] (2,1) [none,breeze,none,none,none] ok B P? A (1,2) [stench,none,none,none,none] L? ok

CSE LOGIC12 The Lion World (1,1) [none,none,none,none,none] (2,1) [none,breeze,none,none,none] (1,2) [stench,none,none,none,none] ok B P? A (2,3)[Stench,none,Glitter,none,none] L? (2,2) [none,none,none,none,none] ok

CSE LOGIC13 The Lion World The Knowledge Base ¬ S 1,1, ¬ B 1,1 P 3,1, B 4,1 ¬ S 2,1, B 2,1 ¬ S 3,2, B 3,2 S 1,2, ¬ B 1,2 ¬ S 2,2, ¬ B 2,2 ¬ S 3,3, ¬ B 3,3 Gl 1,4,¬ S 1,4, ¬ B 1,4 ¬ S 2,4, ¬ B 2,4, G 2.4 B 3,4, Gl 3,4 ¬ S 1,3, ¬ B 1,3, L 1,3 B 4,3 S 2.3, ¬ B 2.3, Gl 2.3 P 4,4

CSE LOGIC14 Lion World Implications R1 : ¬ S 1,1 → ¬ L 1,2 /\ ¬ L 2,1 R2 : ¬ S 2,1 → ¬ L 1,1 /\ ¬ L 2,2 /\ ¬ L 3,1 R3 : ¬ S 1,2 → ¬ L 1,1 /\ ¬ L 2,2 /\ ¬ L 1,3 R4 : S 1,2 → L 1,1 \/ L 2,2 \/ L 1,3

CSE LOGIC15 Lion World Implications transformed into Conjunctive Normal Form (R1-R3) R1 : ¬ S 1,1 → ¬ L 1,2 /\ ¬ L 2,1 R1 : ¬ ¬ S 1,1 \/ ( ¬ L 1,2 /\ ¬ L 2,1 ) R1 : S 1,1 \/ (¬ L 1,2 /\ ¬ L 2,1 ) R1: (S 1,1 \/ ¬ L 1,2 )/\ (S 1,1 \/ ¬ L 2,1 ) R1: (S 1,1 \/ ¬ L 1,2 ), (S 1,1 \/ ¬ L 2,1 )

CSE LOGIC16 Lion World Implications transformed into Conjunctive Normal Form – R4 R4 : S 1,2 → L 1,1 \/ L 2,2 \/ L 1,3 R4 : ¬ S 1,2 \/ (L 1,1 \/ L 2,2 \/ L 1,3 ) R4: ¬ S 1,2 \/ L 1,1 \/ L 2,2 \/ L 1,3

CSE LOGIC17 The Lion World (1,1) [none,none,none,none,none] A ok

CSE LOGIC18 ¬ S 1,1, S 1,1 \/ ¬L 1,2 Unit Resolution ¬ L 1,2 ¬ S 1,1, S 1,1 \/ ¬L 2,1 Unit Resolution ¬ L 2,1 Finding the Lion

CSE LOGIC19 The Lion World ok B P? A (1,2) [stench,none,none,none,none] L?

CSE LOGIC20 S 1,2, ¬ S 1,2 \/ L 1,1 \/ L 2,2 \/ L 1,3 L 1,1 \/ L 2,2 \/ L 1,3 Unit Resolution L 1,1 \/ L 2,2 \/ L 1,3,¬ L 1,1 L 2,2 \/ L 1,3 Unit Resolution Finding the Lion

CSE LOGIC21 Finding the Lion L 2,2 \/ L 1,3,¬ L 2,2 L 1,3 Unit Resolution How do we know ¬ L 2,2 ?

CSE LOGIC22 Avoiding the Lion Don’t go forward if the lion is in front – A 1,2 /\ North A /\ L 1,3  ¬Forward 64 rules (16 squares x 4 orientations)

CSE LOGIC23 Avoiding the Lion in the next move After the Agent moves, A 1,2 is no longer true, now A 2,3 is true. A 2,3 /\ West A /\ L 1,3  ¬Forward

CSE LOGIC24 Limitations of Propositional Logic Can’t express generalities Need new propositions for each time stamp