CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16: Predicate Calculus 8.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12–Prolog examples: Himalayan club, member, rem_duplicate,
The Foundations: Logic and Proofs
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10– Club and Circuit Examples.
Standard Logical Equivalences
First-Order Logic (FOL) aka. predicate calculus. First-Order Logic (FOL) Syntax User defines these primitives: – Constant symbols (i.e., the "individuals"
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9,10,11- Logic; Deduction Theorem 23/1/09 to 30/1/09.
CS344: Artificial Intelligence
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–5 and 6: Propositional Calculus.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 7– Predicate Calculus and Knowledge Representation.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–28, 29: Predicate Calculus;
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10a- knowledge representation.
1 FOL Resolution based Inferencing Resolution based rules studied earlier can lead to inferences, rules such as modus ponen, unit resolution etc… Other.
Logic Programming Languages. Objective To introduce the concepts of logic programming and logic programming languages To introduce a brief description.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21– Predicate Calculus and Knowledge Representation 7 th September,
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
CS621: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–4: Fuzzy Inferencing 29 th July 2010.
Predicates and Quantifiers
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 22, 23- Prolog.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 17, 18: Predicate Calculus 15.
Propositional Calculus Composed of symbols –P – some true statement P might represent something like “It is Monday” or “the car is red” And sentences –a.
Pattern-directed inference systems
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
1.  Provides the ability to access individual assertions. e.g. in Predicate calculus we may say: P denotes “It rained on Tuesday” but in predicate calculus.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 28– Interpretation; Herbrand Interpertation 30 th Sept, 2010.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 19: Interpretation in Predicate.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 37–Prolog- cut and backtracking; start of Fuzzy Logic.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–4: Fuzzy Control of Inverted.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9 Continuation of Logic and Semantic Web.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–7, 9, 10,14: Predicate calculus.
Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–7: (a) Formal System;(b) How to read research papers 3 rd August, 2010.
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
CS621: Artificial Intelligence Lecture 28: Propositional calculus; Puzzle Solving Pushpak Bhattacharyya Computer Science and Engineering Department IIT.
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.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9- Completeness proof; introducing knowledge representation.
Propositional Logic Predicate Logic
CS621: Artificial Intelligence
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: AI, Logic, and Puzzle Solving.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
1-1 An Introduction to Logical Programming Sept
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture /08/05 Prof. Pushpak Bhattacharyya Fuzzy Logic Application.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 35–Himalayan Club example; introducing Prolog.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 26/Feb/2007.
Prof. Pushpak Bhattacharyya, IIT Bombay1 CS 621 Artificial Intelligence Lecture /08/05 Prof. Pushpak Bhattacharyya Fuzzy Inferencing.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 4- Logic.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–6: Propositional calculus, Semantic Tableau, formal System 2 nd August,
CS621: Artificial Intelligence
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
CS 621 Artificial Intelligence Lecture 1 – 28/07/05
Logic Programming Languages
CS 621 Artificial Intelligence Lecture 4 – 05/08/05
Knowledge Representation and Inference
CS621: Artificial Intelligence
CSNB234 ARTIFICIAL INTELLIGENCE
Predicates and Quantifiers
CS621 : Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
Artificial Intelligence
Logical and Rule-Based Reasoning Part I
CS621: Artificial Intelligence
Prof. Pushpak Bhattacharyya, IIT Bombay
The Foundations: Logic and Proofs
Artificial Intelligence
Artificial Intelligence
Presentation transcript:

CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16: Predicate Calculus 8 th and 14 th Feb, 2011

Predicate Calculus: well known examples Man is mortal : rule ∀ x[man(x) → mortal(x)] shakespeare is a man man(shakespeare) To infer shakespeare is mortal mortal(shakespeare)

Predicate Calculus: origin Predicate calculus originated in language Sentence PredicateSubject Grass is green Subject Predicate green(grass) D : Domain

Predicate Calculus: only for declarative sentences Is grass green ? Oh, grass is green! Grass which is supple is green supple(grass) green(grass) Declarative Sentence PredicateSubject

PC primitive: N-ary Predicate Arguments of predicates can be variables and constants Ground instances : Predicate all whose arguments are constants

N-ary Functions president(India) : Prathiba Patel Constants & Variables : Zero-order objects Predicates & Functions : First-order objects President of India is a lady lady(president(India)) Prime minister of India is older than the president of India older(prime_minister(India), president(India))

Operators Universal Quantifier Existential Quantifier All men are mortal Some men are rich

Tautologies 2 nd tautology in English: Not a single man in this village is educated implies all men in this village are uneducated Tautologies are important instruments of logic, but uninteresting statements!

Inferencing: Forward Chaining man(x) → mortal(x) Dropping the quantifier, implicitly Universal quantification assumed man(shakespeare) Goal mortal(shakespeare) Found in one step x = shakespeare, unification

Backward Chaining man(x) → mortal(x) Goal mortal(shakespeare) x = shakespeare Travel back over and hit the fact asserted man(shakespeare)

Wh-Questions and Knowledge what how why where which who when Factoid / Declarative procedural Reasoning

Fixing Predicates Natural Sentences Verb(subject,object) predicate(subject)

Examples Ram is a boy Boy(Ram)? Is_a(Ram,boy)? Ram Playes Football Plays(Ram,football)? Plays_football(Ram)?

Knowledge Representation of Complex Sentence “In every city there is a thief who is beaten by every policeman in the city”

Himalayan Club example Introduction through an example (Zohar Manna, 1974): Problem: A, B and C belong to the Himalayan club. Every member in the club is either a mountain climber or a skier or both. A likes whatever B dislikes and dislikes whatever B likes. A likes rain and snow. No mountain climber likes rain. Every skier likes snow. Is there a member who is a mountain climber and not a skier? Given knowledge has: Facts Rules

Example contd. Let mc denote mountain climber and sk denotes skier. Knowledge representation in the given problem is as follows: 1. member(A) 2. member(B) 3. member(C) 4. ∀ x[member(x) → (mc(x) ∨ sk(x))] 5. ∀ x[mc(x) → ~like(x,rain)] 6. ∀ x[sk(x) → like(x, snow)] 7. ∀ x[like(B, x) → ~like(A, x)] 8. ∀ x[~like(B, x) → like(A, x)] 9. like(A, rain) 10. like(A, snow) 11. Question: ∃ x[member(x) ∧ mc(x) ∧ ~sk(x)] We have to infer the 11 th expression from the given 10. Done through Resolution Refutation.

Club example: Inferencing 1. member(A) 2. member(B) 3. member(C) 4. – Can be written as – 5. – 6. – 7. –

8. – – Negate–

Now standardize the variables apart which results in the following 1. member(A) 2. member(B) 3. member(C)