CS344 Artificial Intelligence Prof. Pushpak Bhattacharya Class on 5 Mar 2007.

Slides:



Advertisements
Similar presentations
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
Advertisements

Predicates and Quantifiers
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 Artificial Intelligence Prof. Pushpak Bhattacharya Class on 6 Mar 2007.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21– Predicate Calculus and Knowledge Representation 7 th September,
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Introduction to Database Systems 1 Relational Calculus Relational Model : Topic 2.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
1 CS 1502 Formal Methods in Computer Science Lecture Notes 12 Variables and Quantifiers.
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Chapter 1: The Foundations: Logic and Proofs
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 17, 18: Predicate Calculus 15.
Nested Quantifiers. 2 Nested Iteration Let the domain be {1, 2, …, 10}. Let P(x, y) denote x > y.  x,  y, P(x, y) means  x, (  y, P(x, y) ) Is the.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
CS344: Introduction to Artificial Intelligence Lecture: Herbrand’s Theorem Proving satisfiability of logic formulae using semantic trees (from Symbolic.
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.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Logic Seminar 1 Introduction Slobodan Petrović.
CS6133 Software Specification and Verification
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–7: (a) Formal System;(b) How to read research papers 3 rd August, 2010.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9- Completeness proof; introducing knowledge representation.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
LDK R Logics for Data and Knowledge Representation First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
Table of Contents Rational Functions and Domains where P(x) and Q(x) are polynomials, Q(x) ≠ 0. A rational expression is given by.
Table of Contents Rational Expressions and Functions where P(x) and Q(x) are polynomials, Q(x) ≠ 0. Example 1: The following are examples of rational expressions:
CS344 Artificial Intelligence Prof. Pushpak Bhattacharya Class on 26 Mar 2007.
Semantics of Predicate Calculus For the propositional calculus, an interpretation was simply an assignment of truth values to the proposition letters of.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 CS1502 Formal Methods in Computer Science Notes 15 Problem Sessions.
1 Chapter 2.1 Chapter 2.2 Chapter 2.3 Chapter 2.4 All images are copyrighted to their respective copyright holders and reproduced here for academic purposes.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture 16 – 09/09/05 Prof. Pushpak Bhattacharyya Soundness, Completeness,
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12 th August, 2010.
CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 12/Feb/2007.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
3. The Logic of Quantified Statements Summary
Predicates and Quantified Statements I
Introduction to Logic for Artificial Intelligence Lecture 2
CSE15 Discrete Mathematics 01/23/17
Chapter 3 The Logic of Quantified Statements
Today’s Topics Universes of Discourse
CS201: Data Structures and Discrete Mathematics I
Data Types, Identifiers, and Expressions
1st-order Predicate Logic (FOL)
First Order Logic Rosen Lecture 3: Sept 11, 12.
Week #2 – 4/6 September 2002 Prof. Marie desJardins
Back to “Serious” Topics…
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
Formal Methods in software development
Predicates and Quantifiers
CS621 : Artificial Intelligence
CS201: Data Structures and Discrete Mathematics I
CS621: Artificial Intelligence
Artificial Intelligence
1st-order Predicate Logic (FOL)
Presentation transcript:

CS344 Artificial Intelligence Prof. Pushpak Bhattacharya Class on 5 Mar 2007

Interpretation in Logic Logical expressions or formulae are “FORMS” (placeholders) for whom contents are created through interpretation. Example: This is a Second Order Predicate Calculus formula. Quantification on ‘F’ which is a function.

Interpretation – 1 a and b ∈ N In particular, a = 0 and b = 1 x ∈ N P(x) stands for x > 0 g(m,n) stands for (m x n) h(x) stands for (x – 1) Above interpretation defines Factorial Examples

Interpretation – 2 a = b = λ P(x) stands for “x is a non empty string” g(m, n) stands for “append head of m to n” h(x) stands for tail(x) Above interpretation defines “reversing a string” Examples (contd.)

More Examples ∀ x [ P(x) → Q(x)] Following interpretations conform to above expression: man(x) → mortal(x) dog(x) → mammal(x) prime(x) → 2_or_odd(x) CS(x) → bad_hand_writing(x)

Structure of Interpretation All interpretations begin with a domain ‘D’, constants (0-order functions) and functions pick values from there. With respect to - ∀ x [ P(x) → Q(x)] D = {living beings} P: D → {T, F} Q: D → {T, F} P can be looked upon as a table shown here: Elements of D i.e. x P(x) RamT PushpakT Virus 1201 F

Factorial interpretation of the structure D = {0, 1, 2, …, ∞ } a = 0, b = 1 g(m, n) = m x n and g: D x D → D h(x) = (x – 1) and h(0) = 0, h: D →D P(x) is x > 0 and P: D → {T, F}

Steps in Interpretation 1.Fix Domain D 2.Assign values to constants 3.Define functions 4.Define predicates An expression which is true for all interpretations is called valid or tautology. Interpretations and their validity in “Herbrand’s Universe” is sufficient for proving validity in Predicate Calculus. Note:- Possible seminar topic – “Herbrand’s Interpretation and Validity”