Propositional & Predicate Calculus _I

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

Artificial Intelligence
First-Order Logic Chapter 8.
March 2, 2006AI: Chapter 8: First-Order Logic1 Artificial Intelligence Chapter 8: First-Order Logic Michael Scherger Department of Computer Science Kent.
1 A formula in predicate logic An atom is a formula. If F is a formula then (~F) is a formula. If F and G are Formulae then (F /\ G), (F \/ G), (F → G),
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
Artificial Intelligence
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
Predicate Calculus Russell and Norvig: Chapter 8,9.
Knowledge Representation Methods
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.
Artificial Intelligence Lecture No. 10 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
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.
Logic. Propositional Logic Logic as a Knowledge Representation Language A Logic is a formal language, with precisely defined syntax and semantics, which.
First-Order Logic Chapter 8.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
FIRST-ORDER LOGIC FOL or FOPC
First-Order Logic Chapter 8. Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Knowledge engineering in FOL.
Predicate Calculus.
CE An introduction to Artificial Intelligence CE Chapter 8: First Order Logic Ramin Halavati In which we notice that.
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
FIRST ORDER LOGIC Levent Tolga EREN.
Adapted from Discrete Math
Predicates and Quantifiers
UNIVERSITI TENAGA NASIONAL 1 CSNB234 ARTIFICIAL INTELLIGENCE Chapter 3 Propositional Logic & Predicate Logic Chapter 3 Propositional Logic & Predicate.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
2.2 Statements, Connectives, and Quantifiers
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
1 CMSC 471 Fall 2002 Class #10/12–Wednesday, October 2 / Wednesday, October 9.
Limitation of propositional logic  Propositional logic has very limited expressive power –(unlike natural language) –E.g., cannot say "pits cause breezes.
First-Order Logic Chapter 8. Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Knowledge engineering in FOL.
First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 11 of 41 Wednesday, 15.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Artificial Intelligence First-Order Logic (FOL). Outline of this Chapter The need for FOL? What is a FOL? Syntax and semantics of FOL Using FOL.
C. Varela1 Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November.
CS-554 Part-3: First-Order Logic
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 11 Jim Martin.
First-Order Logic Chapter 8 (not 8.1). Outline Why FOL? Why FOL? Syntax and semantics of FOL Syntax and semantics of FOL Using FOL Using FOL Wumpus world.
First-Order Logic. Outline Why FOL? Syntax and semantics of FOL Using FOL Knowledge engineering in FOL.
LOGIC. Logic in general  Logics are formal languages for representing information such that conclusions can be drawn  Syntax defines the sentences in.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
PREDICATE CALCULS In Propositional Calculus, each atomic symbol denotes a proposition. But there is no way to access the components of an individual assertion.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Chapter 3 Propositional calculus Predicate calculus Artificial Intelligence Dr.Hassan Al-Tarawneh.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
Simple Logic.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
The Predicate Calculus
Course Instructor: kinza ch
CSNB 143 Discrete Mathematical Structures
CS201: Data Structures and Discrete Mathematics I
(1.4) An Introduction to Logic
PROPOSITIONAL LOGIC - SYNTAX-
MAT 3100 Introduction to Proof
Predicates and Quantifiers
CSNB234 ARTIFICIAL INTELLIGENCE
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Propositional & Predicate Calculus _I

Propositional Logic vs. Predicate Calculus The world consists of propositions (sentences) which can be true or false. Predicate Calculus (First Order Logic) The world consists of objects, functions and relations between the objects.

Propositional calculus: The proposition calculus and the predicate calculus are first of all language using their word , phrase and sentences which we can represent and reason about properties and relation ship in the world.

Proposition symbol P,Q,R….. Proposition calculus symbol: the symbol about the proposition calculus are : Proposition symbol P,Q,R….. Truth Symbol : True , false and Connective =, , , , …..

example The wumpus world Hunt the Wumpus is an early computer game, based on a simple hide and seek format . We might use W1,2 stand for proposition that the wumpus is in [1,2]. Symbole such W1,2 is atomic as shown in the next slide.

Syntax of FOL: Basic elements Constants KingJohn, 2, NUS,... Predicates Brother, >,... Functions Sqrt, LeftLegOf,... Variables x, y, a, b,... Connectives , , , ,  Equality = Quantifiers , 

with examples Syntax Term: Atomic Sentence Complex Sentence constant|variable|function(term, …, term) War-and-Peace author-of(War-and-Peace) father-of(author-of(War-and-Peace)) Atomic Sentence predicate(term, …, term) Complex Sentence

Every propositional symbol and truth symbol is a sentence. Examples: true, P, Q, R. The negation of a sentence is a sentence. Examples: P,  false. The conjunction, or and, of two sentences is a sentence. Example: P  P

The disjunction, or or, of two sentences is a sentence. Example: P  P The implication of one sentence from another is a sentence. Example: P  Q The equivalence of two sentences is a sentence. Example: P  Q  R Legal sentences are also called well-formed formulas or WFFs.

“If it is hot and humid, then it is raining” Q  P example P means “It is hot.” Q means “It is humid.” R means “It is raining.” (P  Q)  R “If it is hot and humid, then it is raining” Q  P “If it is humid, then it is hot”

Truth tables for connectives

Universal Quantifier Brothers are siblings Mother: a female parent of a plant or animal

Existential Quantifier A red object is on top of a green one An author is a person who writes documents A grandparent is the parent of one’s parent

Quantifier allow statements about many objects apply to sentence containing variable universal : true for all substitutions for the variable existential : true for at least one substitution for the variable.

Properties of Quantifiers

The cost of an omelette at the Red Lion is £5” Normally: cost_of(omelette,red_lion,five_pou nds)

Examples on predicate calculus

If it doesn’t rain tomorrow, Tom will go to the mountains Examples of representing English sentence If it doesn’t rain tomorrow, Tom will go to the mountains Øweather(rain, tomorrow) Þ go(tom, mountains) Bisang is a Jindogae and a good dog gooddog(bisang) Ù isa(bisang, jindogae) All basketball players are tall " X (basketball_player(X) Þ tall(X)) If wishes were horses, beggars would ride. equal(wishes, horses) Þ ride(beggars). Nobody likes taxes Ø$ X likes(X, taxes)

Given statements converted to formulae in predicate logic: Marcus was a man. man(Marcus). 2. Marcus was a Pompein. Pompein(Marcus). 3. All Pompeins were Romans. "x Pompein(x) → Roman(x).

4. Caesaer was a ruler. ruler(Caeser). 5. All Romans were either loyal to Caeser or (EOR) hated him "x Roman(x) → loyalto(x, Caeser) \/ hate(x,Caeser). OR "x Roman(x) → ((loyalto(x, Caeser) \/ hate(x,Caeser) /\ ~(loyalto(x, Caeser) /\ hate(x,Caeser))) . EOR