CT214 – Logical Foundations of Computing Lecture 6 Predicate Calculus.

Slides:



Advertisements
Similar presentations
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Relational Calculus Chapter 4, Part B.
Advertisements

1 541: Relational Calculus. 2 Relational Calculus  Comes in two flavours: Tuple relational calculus (TRC) and Domain relational calculus (DRC).  Calculus.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Knowledge Representation Methods
RMIT University; Taylor's College This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done.
First-Order Logic. Limitations of propositional logic Suppose you want to say “All humans are mortal” –In propositional logic, you would need ~6.7 billion.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Predicates and quantifiers Chapter 8 Formal Specification using Z.
Predicate Calculus.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Rutgers University Relational Calculus 198:541 Rutgers University.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Discussion #141/20 Discussion #14 Predicate Calculus.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Relational Calculus Chapter 4, Section 4.3.
Database Management Systems, R. Ramakrishnan1 Relational Calculus Chapter 4.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
© Jalal Kawash 2010Peeking into Computer Science George Boole English Mathematician His The Mathematical Analysis of Logic, 1848 is the first.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
Lecture 4: Predicates and Quantifiers; Sets.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
C. Varela1 Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November.
Lecture Predicates and Quantifiers 1.4 Nested Quantifiers.
COMP 170 L2 L08: Quantifiers. COMP 170 L2 Outline l Quantifiers: Motivation and Concepts l Quantifiers: Notations and Meaning l Saying things with Quantified.
Logical Operations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Logical Operations Reading: Kolman, Section 2.1.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Discrete Structures – CNS 2300
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
Database Management Systems, R. Ramakrishnan1 Relational Calculus Chapter 4, Part B.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Propositional and predicate logic
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
CSNB 143 Discrete Mathematical Structures
Relational Calculus Chapter 4, Part B
Predicates & Quantifiers
2.1 Propositions and Logical Operations
Predicate Calculus Discussion #14 Chapter 2, Section 1 1/20.
Discussion #14 Predicate Calculus
CMSC Discrete Structures
CS201: Data Structures and Discrete Mathematics I
1.4 Predicates and Quantifiers
Predicate Calculus Discussion #14 Chapter 2, Section 1.
Carlos Varela Rensselaer Polytechnic Institute November 10, 2017
Introduction to Predicates and Quantified Statements I
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
George Boole English Mathematician
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
Predicate Calculus. Predicate Calculus Topics Predicates Variables and instantiation Quantifiers Logical expressions Bound and free variables.
Relational Calculus Chapter 4, Part B
Presentation transcript:

CT214 – Logical Foundations of Computing Lecture 6 Predicate Calculus

Predicate Calculus - The extension of propositional calculus that enables the use of variables such that quantified statements such as “there exists an x such that...” or “for any x, it is the case that...”, can be dealt with. Predicate – A function that returns either true or false. Quantifier – A symbol that indicates the degree to which the predicate is true for a specified set.

Universal Quantifier ( ) – Indicates that a predicate is true for all members of a specified set. Equivalent to saying – “For each” Existential Quantifier ( ) – Indicates that a predicate is true for at least one member of a specified set. Equivalent to saying – “There exists”

Variables: X, Y, Z Quantifiers:, Symbols:, ( ), { } Universe: U whereU = {u 1, u 2, u 3, , u n }

Definition:Universal quantifier X : U P(X) Means P(u 1 ) ^ P(u 2 ) ^ P(u 3 ) ^ P(u n ) Definition:Existential quantifier X : U P(X) Means P(u 1 ) v P(u 2 ) v P(u 3 ) v P(u n )

Atomic predicate – Built from predicate symbol, constants, variables and symbols like ( ), but not using connectives. Predicate Symbol For example:P ( X )orP ( joe ) VariableConstant

P( joe )“joe is a tall person” P( X )“X is a tall person” U = the set of all people,X is an element of U Q( joe, cisco )“joe is employed by cisco” Q( X, Y )“person X is employed by company Y”

R( yuri, russia, russian ) “yuri from russia speaks russian” R( X, Y, Z ) “person X from country Y speaks language Z” Predicates can be formed by combining atomic predicates using logical connectives e.g.P( X ) ^ Q( X, Y ) “X is a tall person AND X is employed by Y”

Relative Quantification – Want to restrict or to some subset of U that satisfies some criteria. 1.Relative Universal Quantification X : U R( X ) -> P( X ) 2. Relative Existential Quantification X : U R( X ) ^ P( X ) R is a statement which narrows down the universe

1.Relative Universal Quantification X : U R( X ) -> P( X )

2. Relative Existential Quantification X : U R( X ) ^ P( X )

Example:Each German must vote X : U G( X ) -> V( X ) G - Germans V - Voters U – All people

Note that the universe is important! Each German must vote X : U V( X ) V - Voters U – All Germans

Example:Some French don’t vote X : U F( X ) ^ ¬V( X ) F - French ¬V – Non- voters U – All people

Example:London is bigger than any city in Europe X : U E( X ) -> B( London, X ) E( X ) – X is a European city B( Y, X ) – City Y is bigger than city X

Empty universes: U = = { } = null set X : U P( X )= True X : U P( X )= False Example: “All Irish people who went to the moon liked it there”

Example: “All Irish people who went to the moon liked it there” U = {All Irish people who went to the moon} = X : U L( X )= True No Irish people every went to the moon so “All Irish people who went to the moon liked it there” is a true statement.

Example: “Some Irish people who went to the moon liked it there” U = {All Irish people who went to the moon} = X : U L( X )= False There must be at least one Irish person who went to the moon in order for it to be possible for this statement to be true.