CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21– Predicate Calculus and Knowledge Representation 7 th September,

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,
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10– Club and Circuit Examples.
Standard Logical Equivalences
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.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
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.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
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.
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.
CS621: Artificial Intelligence Lecture 27: Backpropagation applied to recognition problems; start of logic Pushpak Bhattacharyya Computer Science and Engineering.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 22, 23- Prolog.
Discrete Mathematics and Its Applications
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Chapter 1: The Foundations: Logic and Proofs
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
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 12- Completeness Proof; Self References and Paradoxes 16 th August,
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 15, 16: Predicate Calculus 8.
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.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–7: (a) Formal System;(b) How to read research papers 3 rd August, 2010.
KNOWLEDGE BASED SYSTEMS
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.
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
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: AI, Logic, and Puzzle Solving.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
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.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture 16 – 09/09/05 Prof. Pushpak Bhattacharyya Soundness, Completeness,
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12 th August, 2010.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 26/Feb/2007.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 4- Logic.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–6: Propositional calculus, Semantic Tableau, formal System 2 nd August,
CS621: Artificial Intelligence
Chapter 7. Propositional and Predicate Logic
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
CS 621 Artificial Intelligence Lecture 1 – 28/07/05
CS 621 Artificial Intelligence Lecture 4 – 05/08/05
Back to “Serious” Topics…
CS621: Artificial Intelligence
Chapter 7. Propositional and Predicate Logic
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
Artificial Intelligence
Artificial Intelligence
Presentation transcript:

CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21– Predicate Calculus and Knowledge Representation 7 th September, 2010

Logic and inferencing Vision NLP Expert Systems Planning Robotics  Search  Reasoning  Learning  Knowledge Obtaining implication of given facts and rules -- Hallmark of intelligence

Inferencing through − Deduction (General to specific) − Induction (Specific to General) − Abduction (Conclusion to hypothesis in absence of any other evidence to contrary) Deduction Given:All men are mortal (rule) Shakespeare is a man (fact) To prove:Shakespeare is mortal (inference) Induction Given:Shakespeare is mortal Newton is mortal (Observation) Dijkstra is mortal To prove:All men are mortal (Generalization)

If there is rain, then there will be no picnic Fact1: There was rain Conclude: There was no picnic Deduction Fact2: There was no picnic Conclude: There was no rain (?) Induction and abduction are fallible forms of reasoning. Their conclusions are susceptible to retraction Two systems of logic 1) Propositional calculus 2) Predicate calculus

Propositions − Stand for facts/assertions − Declarative statements − As opposed to interrogative statements (questions) or imperative statements (request, order) Operators => and ¬ form a minimal set (can express other operations) - Prove it. Tautologies are formulae whose truth value is always T, whatever the assignment is

Model In propositional calculus any formula with n propositions has 2 n models (assignments) - Tautologies evaluate to T in all models. Examples: 1) 2) - e Morgan with AND

Inferencing in PC Resolution Forward chaining Backward chaining

Knowledge Declarative Procedural Declarative knowledge deals with factoid questions (what is the capital of India? Who won the Wimbledon in 2005? etc.) Procedural knowledge deals with “How” Procedural knowledge can be embedded in declarative knowledge

Example: Employee knowledge base Employee record Emp id : 1124 Age : 27 Salary : 10L / annum Tax : Procedure to calculate tax from basic salary, Loans, medical factors, and # of children

Predicate Calculus

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)

Forward Chaining/ Inferencing 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/ Inferencing 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)