ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.

Slides:



Advertisements
Similar presentations
The Predicate Calculus
Advertisements

Artificial Intelligence
First-Order Logic Chapter 8.
The Logic of Quantified Statements
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.
Logic. Propositional Logic Logic as a Knowledge Representation Language A Logic is a formal language, with precisely defined syntax and semantics, which.
The Predicate Calculus
Artificial Intelligence
Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, First lecture slides read: Second lecture slides read:
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
The Predicate Calculus
FIRST-ORDER LOGIC FOL or FOPC
The Predicate Calculus
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.
FIRST ORDER LOGIC Levent Tolga EREN.
Adapted from Discrete Math
Predicates and Quantifiers
Discrete Mathematics and Its Applications
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
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.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
CS 415 – A.I. Slide Set 4. Yamauchi Paper Exploration via data about frontier space – How to detect frontier space – How to use it to choose navigation.
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.
Propositional Calculus Knowledge based agent Knowledge is contained in agents in the form of sentences in a knowledge representation language stored in.
Formal Methods in Software Engineering 1
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Artificial Intelligence Chapter 15 The Predicate Calculus Artificial Intelligence Chapter 15 The Predicate Calculus Biointelligence Lab School of Computer.
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.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
1 CSC384: Intro to Artificial Intelligence Lecture 5.  Knowledge Representation.
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.
Semantics of Predicate Calculus For the propositional calculus, an interpretation was simply an assignment of truth values to the proposition letters of.
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
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.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
1 CSC 384 Lecture Slides (c) , C. Boutilier and P. Poupart CSC384: Intro to Artificial Intelligence  Jan 12 th  Announcements: Tutorial splits.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
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.
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 3 Propositional calculus Predicate calculus Artificial Intelligence Dr.Hassan Al-Tarawneh.
Propositional Calculus
Knowledge Representation and Reasoning 2
The Predicate Calculus
Introduction to Logic for Artificial Intelligence Lecture 2
Knowledge Representation using First-Order Logic
Course Instructor: kinza ch
Notes 8: Predicate logic and inference
Artificial Intelligence
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
CHAPTER 1: LOGICS AND PROOF
Resolution And yet Another Example:
Artificial Intelligence Chapter 15. The Predicate Calculus
Predicates and Quantifiers
Chapter 1: Propositional and First-Order Logic
Propositional Calculus
Predicate Logic: Syntax.
Predicate Logic.
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus

Contents Why Predicate Calculus? Predicate Calculus Syntax – Symbols-Terms-Sentences – Verification of expressions Predicate Calculus Semantics – Interpretation – Quantifiers: Universal, Existential Truth Value of Predicate Calculus Expression Example: Blocks World

Why Predicate Calculus? There is no way to access the components of an individual assertion. – Proposition: “It rained on Tuesday” – Predicate: Weather( tuesday, rain) Predicate calculus also allows expressions to contain variables. – Variables let us create general assertions about classes of entities. – We could state that for all values of X where X is a day of the week, the statement weather(X, rain) is true

Why Predicate Calculus? Whereas propositional logic assumes the world contains Facts, predicate logic assumes the world contains – Objects: people, houses, numbers, colors, baseball games, wars, … – Relations: red, round, prime, brother of, bigger than, part of, comes between, … – Functions: father of, best friend, one more than, plus, …

Predicate Calculus Syntax

Symbols-Terms-Sentences Predicate calculus symbols include: 1. Truth symbols true and false 2. Constant symbols are symbol expressions having the first character lowercase. 3. Variable symbols are symbol expressions beginning with an uppercase character. 4. Function symbols are symbol expressions having the first character lowercase.

Symbols-Terms-Sentences Functions have an attached arity indicating the number of elements of the domain mapped onto each element of the range. A function expression consists of a function constant of arity n, followed by n terms, t 1, t 2,, t n, enclosed in parentheses and separated by commas. A term is either a constant, variable, or function expression

Terms Terms denote objects and properties in a problem domain. Examples of terms are: cat Times(2,3) X blue mother(jane) kate

PREDICATES-ATOMIC SENTENCES Predicate symbols are symbols beginning with a lowercase letter. An atomic sentence is a predicate constant of arity n, followed by n terms, t 1, t 2,, t n, enclosed in parentheses and separated by commas. Preddicate snetence ends by a period. – Likse(student, math). – Likes(student, math, al_azhar).

Syntactic Rules 1.If s is a sentence, then so is its negation,  s. 2.If s1 and s2 are sentences, then so is their conjunction, s1  s2. 3.If s1 and s2 are sentences, then so is their disjunction, s1  s2. 4.If s1 and s2 are sentences, then so is their implication, Si  s2. 5.If s1 and s2 are sentences, then so is their equivalence, s1 = s2. 6.If X is a variable and s a sentence, then  X s is a sentence. 7.If X is a variable and s a sentence, then  X s is a sentence.

Verification of expressions

Predicate Calculus Semantics

Interpretation Let the domain D be a nonempty set. An interpretation over D is an assignment of the entities of D to each of the constant, variable, predicate, and function symbols of a predicate calculus expression, such that: 1. Each constant is assigned an element of D. 2. Each variable is assigned to a nonempty subset of D; these are the allowable substitutions for that variable. 3. Each function f of arity m is defined on m arguments of D and defines a mapping from Dm into D. 4. Each predicate p of arity n is defined on n arguments from D and defines a mapping from D n into {T, F}. The meaning of an expression is a truth value assignment over the interpretation.

Quantifiers: Universal, Existential Universal Quantifier  The sentence is true for all constants that can be substituted for the variable under the intended interpretation. In this case, the variable is said to be universally quantified. Existential Quantifier  The sentence containing the variable is said to be true for at least one substitution from the domain of definition.

Truth Value of Expressions 1. The value of a constant is the element of D it is assigned to by I. 2. The value of a variable is the set of elements of D it is assigned to by I. 3. The value of a function expression is that element of D obtained by evaluating the function for the parameter values assigned by the interpretation.

Truth Value of Expressions 4. The value of truth symbol "true: is T and "false" is F. 5. The value of an atomic sentence is either T or F, as determined by the interpretation I. 6. The value of the negation of a sentence is T if the value of the sentence is F and is F if the value of the sentence is T.

Truth Value of Expressions 7. The value of the conjunction of two sentences is T if the value of both sentences is T and is F otherwise The truth value of expressions using v, =>, and = is determined from the value of their operands as defined propositional calculus.

Truth Value of Expressions For a variable X and a sentence S containing X: 11. The value of  X S is T if S is T for all assignments to X under I, and it is F otherwise. 12. The value of  X S is T if there is an assignment to X in the interpretation under which S is T; otherwise it is F.

Example: Blocks World c a b d

Blocks World: Knowledge Base on(c,a). on(b,d). ontable(a). ontable(d). clear(b). clear(c). hand_empty.

Blocks World: Rules The following rule describes when a block is clear:  X (   Y on(Y,X)  clear(X)). Operation : to stack X on Y first empty the hand, then clear X, then clear Y, and then pick_up X and put_down X on Y.  X  Y ((hand_empty  clear(X)  clear(Y)  pick_up(X)  put_down(X,Y))  stack(X,Y)).