COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.

Slides:



Advertisements
Similar presentations
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Advertisements

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.
Logic Use mathematical deduction to derive new knowledge.
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
CS128 – Discrete Mathematics for Computer Science
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
3/30/00 Agents that Reason Logically by Chris Horn Jiansui Yang Xiaojing Wu.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Logic 1 Statements and Logical Operators. Logic Propositional Calculus – Using statements to build arguments – Arguments are based on statements or propositions.
CSE (c) S. Tanimoto, 2008 Propositional Logic
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
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.
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.
From Chapter 4 Formal Specification using Z David Lightfoot
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Discrete Mathematics Math 6A Instructor: M. Welling.
Let remember from the previous lesson what is Knowledge representation
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Adapted from Discrete Math
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
Propositions and Truth Tables
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
Discrete Mathematics and Its Applications
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Chapter 1: The Foundations: Logic and Proofs
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
Thinking Mathematically
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
1 The Wumpus Game StenchBreeze Stench Gold Breeze StenchBreeze Start  Breeze.
Chapter 1: The Foundations: Logic and Proofs
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Propositional Logic
Discrete Mathematical
2. The Logic of Compound Statements Summary
Conditional Statements
CSNB 143 Discrete Mathematical Structures
Lecture 1 – Formal Logic.
Logic.
(CSC 102) Discrete Structures Lecture 2.
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Information Technology Department
Copyright © Cengage Learning. All rights reserved.
TRUTH TABLES continued.
1 Chapter An Introduction to Problem Solving
1 Chapter An Introduction to Problem Solving
MAT 3100 Introduction to Proof
TRUTH TABLES.
Presentation transcript:

COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB of the Copyright Act 1968 (the Act). The material in this communication may be subject to copyright under the Act. Any further reproduction or communication of this material by you may be the subject of copyright protection under the Act. Do not remove this notice.

Propositional Logic CSE2303 Formal Methods I Lecture 18

Overview Outline of the rest of the lectures Propositions Connectives Tautologies Arguments Representing Knowledge

Outline Knowledge Representation –Propositional Logic –Predicate Calculus Prolog Resolution

Definition A proposition is A statement which is Either true or false.

Examples = 4 –Is a proposition which true. The moon is made of cheese –Is a proposition which is false. It will rain tomorrow –Is a proposition. This statement is false –Is not a proposition. Vote for Mickey Mouse –Is not a proposition.

Negation P : I have three children. ¬P : I do not have three children. Other Notation: ~P

Connectives And  (&) Or  Implies  (  ) Equivalence  (  )

Conjunction P : This subject is boring. Q : I am tired. P  Q : –This subject is boring and I am tired. –This subject is boring although I am tired. –This subject is boring but I am tired.

Disjunction P : Sue is a football player. Q: Bob is lazy. P  Q: Sue is a football player or Bob is lazy. Note: Disjunction is inclusive.

Conditional P: It is Tuesday. Q: We are in Belgium. P  Q: –If it is Tuesday then we are in Belgium. –It’s being Tuesday implies we are in Belgium. –It’s Tuesday only if we are in Belgium. –It’s being Tuesday is sufficient for us to be in Belgium.

Conditional Table P: It will rain tomorrow. Q: I will wear a raincoat tomorrow. P  Q: If it rains tomorrow then I will wear a raincoat.

Biconditional P : The world will blow up. Q : CHAOS rules the world. P  Q : –The world will blow up if and only if CHAOS rules the world. –CHAOS ruling the world is a necessary and sufficient condition that the world will blow up.

Biconditional Table P: It will rain tomorrow. Q: I will wear a raincoat tomorrow. P  Q: I will wear a raincoat tomorrow if and only if it rains.

Interpretation The truth table for a statement provides a record for all possible interpretations of that statement. Example: S: If the price is less than $30 and I have at least $50, then I will buy that CD.

P: The price of the CD is less than $30. L: I have at least $50. B: I will buy that CD. S: (P  L)  B

Definitions A tautology is a statement whose interpretation is always true. We say two statements are logically equivalent if they always have same the interpretation. –Their truth tables are the same.

Fitness Example S: If I exercise then I will get fit, and I do exercise, so I will get fit. E: I do exercise. F: I will get fit. S: (E  F)  E  F

Definition An argument consists of: A set of propostions, P 1, …, P n, called the premises. Another proposition, C, called the conclusion. An argument is called valid if the statement P 1  …  P n  C is a tautology.

Mary’s Exam Example Today Mary has a Law exam or a Computer Science exam or both. She doesn’t have a Law exam. Therefore she must have a Computer Science exam. L: Mary has a Law exam today. C: Mary has a Computer Science exam today. Premises: L  C, ¬L Conclusion: C

Wumpus World The idea of the game is to find the gold. The cave has rooms that lie in a grid. Dangers –The Wumpus (You can smell a Wumpus in the next room) –Pits (You can feel a breeze in the next room) –Bats (You can hear the bats in the next room) You have one arrow you can use to kill a Wumpus.

Example W represents the Wumpus P represents a Pit B represents Bats S is the Starting Position G represents where the gold is

A Game No stench or breeze in square 1,1 –Therefore Wumpus is not in 1,2 or 2,1 Suppose you move to square 2,1 and detect a breeze there. –Therefore there is a Pit in either 2,2 or 3,1 So you go back and up to square 1,2 and detect a stench. –Therefore the Wumpus is in square 1,3.

Notation W 1,1 –The Wumpus is in square 1,1. S 1,2 –A stench was detected in square 1,2. B 2,1 –A breeze was detected in square 2,1. Etc.

Knowledge P 1 : ¬ S 1,1  ¬ B 1,1 P 2 : ¬ S 2,1  B 2,1 P 3 : S 1,2  ¬ B 1,2 P 4 : ¬ S 1,1  ¬ W 1,1  ¬ W 1,2  ¬ W 2,1 P 5 : ¬ S 2,1  ¬ W 1,1  ¬ W 2,1  ¬ W 2,2  ¬ W 3,1 P 6 : ¬ S 1,2  ¬ W 1,1  ¬ W 1,2  ¬ W 2,2  ¬ W 1,3 P 7 : S 1,2  W 1,3  W 1,2  W 2,2  W 1,1

Wumpus Argument Want to obtain the conclusion: W 1,3 Need to show: P 1  P 2  P 3  P 4  P 5  P 6  P 7  W 1,3 is a tautology. Truth Table has 2 12 = 4096 rows.

Problems Need to introduce a lot of propositions to represent any useful knowledge. Using truth tables to show validity requires: –Exponential Space –Exponential Time

Revision Know what are Propositions Know what are connectives and their corresponding truth tables. Know the definition of a tautology and logical equivalence. Know the definition of a valid argument, and how to show an argument in Propositional Logic is valid using truth tables.