Scribd
Upload
52 views26 pages

University of Dar Es Salaam Coict: Department of Computer Science & Eng

(x, McDonalds))  Ask the system queries  Ask (KB, likes(John, McDonalds))  Retract assertions  Retract (KB, person(John)) March 2, 2006 AI: Chapter 8: First-Order Logic 24

Uploaded by

samwel sitta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
52 views26 pages

University of Dar Es Salaam Coict: Department of Computer Science & Eng

(x, McDonalds))  Ask the system queries  Ask (KB, likes(John, McDonalds))  Retract assertions  Retract (KB, person(John)) March 2, 2006 AI: Chapter 8: First-Order Logic 24

Uploaded by

samwel sitta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

University of Dar es Salaam

COICT
Department of Computer Science & Eng.

IS365: Artificial Intelligence


Lecture 4 – Knowledge Representation: First-
Order Logic
Lecturer: Nyamwihula, W.
Block B: Room B09
Mobile: 0784281242/0754588001
Email: wbilungi@gmail.com
Contents

 More on Representation
 Syntax and Semantics of First-Order Logic
 Using First Order Logic
 Knowledge Engineering in First-Order Logic

May 2, 2019 IS365: Lecture 4 First-Order Logic 2


First-Order Logic
 AKA First-Order Predicate Logic
 AKA First-Order Predicate Calculus

 Much more powerful the propositional (Boolean)


logic
 Greater expressive power than propositional logic
 We no longer need a separate rule for each square to say
which other squares are breezy/pits
 Allows for facts, objects, and relations
 In programming terms, allows classes, functions and variables

March 2, 2006 AI: Chapter 8: First-Order Logic 3


Pros and Cons of Propositional Logic
 + Propositional logic is declarative: pieces of syntax
correspond to facts
 + Propositional logic allows for partial / disjunctive /
negated information (unlike most data structures and DB
 + Propositional logic is compositional: the meaning of B11
^ P12 is derived from the meaning of B11 and P12
 + Meaning of propositional logic is context independent:
(unlike natural language, where the meaning depends on
the context)

 - Propositional logic has very limited expressive power:


(unlike natural language)
 E.g. cannot say Pits cause Breezes in adjacent squares except
by writing one sentence for each square

March 2, 2006 AI: Chapter 8: First-Order Logic 4


Pros of First-Order Logic
 First-Order Logic assumes that the world
contains:
 Objects
 E.g. people, houses, numbers, theories, colors, football
games, wars, centuries, …
 Relations
 E.g. red, round, prime, bogus, multistoried, brother of, bigger
than, inside, part of, has color, occurred after, owns, comes
between, …
 Functions
 E.g. father of, best friend, third quarter of, one more than,
beginning of, …

March 2, 2006 AI: Chapter 8: First-Order Logic 5


Logics in General
Language Ontological Epistemological
Commitment Commitment
Propositional Logic Facts True / False /
Unknown
First-Order Logic Fact, objects, relations True / False /
Unknown
Temporal Logic Facts, objects, True / False /
relations, times Unknown
Probability Theory Facts Degree of belief 
[0,1]
Fuzzy Logic Degree of truth  Known interval value
[0,1]

March 2, 2006 AI: Chapter 8: First-Order Logic 6


Syntax of First-Order Logic

 Constants KingJohn, 2, …
 Predicates Brother, >, …
 Functions Sqrt, LeftArmOf, …
 Variables x, y, a, b, …
 Connectives ¬
 Equality =
 Quantifiers $ "

March 2, 2006 AI: Chapter 8: First-Order Logic 7


Components of First-Order Logic
 Term
 Constant, e.g. Red
 Function of constant, e.g. Color(Block1)

 Atomic Sentence
 Predicate relating objects (no variable)
 Brother (John, Richard)
 Married (Mother(John), Father(John))

 Complex Sentences
 Atomic sentences + logical connectives
 Brother (John, Richard) Brother (John, Father(John))

March 2, 2006 AI: Chapter 8: First-Order Logic 8


Components of First-Order Logic
 Quantifiers
 Each quantifier defines a variable for the duration of
the following expression, and indicates the truth of the
expression…

 Universal quantifier “for all” 


 The expression is true for every possible value of the
variable

 Existential quantifier “there exists” 


 The expression is true for at least one value of the
variable
March 2, 2006 AI: Chapter 8: First-Order Logic 9
Truth in First-Order Logic
 Sentences are true with respect to a model and an
interpretation
 Model contains >= 1 object (domain elements) and
relations among them
 Interpretation specifies referents for
 constant symbols -> objects
 predicate symbols -> relations
 function symbols -> functional relations

 An atomic sentence predicate( term1,…,termn) is true iff


the objects referred to by term1,…,termn are in the
relation referred to by predicate

March 2, 2006 AI: Chapter 8: First-Order Logic 10


First-Order Logic Example

March 2, 2006 AI: Chapter 8: First-Order Logic 11


Universal Quantification
  <variables> <sentence>
 x P is true in a model m iff P with x being each
possible object in the model

 Equivalent to the conjunction of instantiations of


P
 At(Mike, KSU)  Smart(Mike) 
 At(Laurie, KSU)  Smart(Laurie) 
 At(Sarah, KSU)  Smart(Sarah) 
 …

March 2, 2006 AI: Chapter 8: First-Order Logic 12


A Common Mistake to Avoid

 Typically  is the main connective with 

 Common mistake: using  as the main


connective with 

 x At(x, KSU)  Smart(x)

March 2, 2006 AI: Chapter 8: First-Order Logic 13


Existential Quantification
  <variables> <sentence>
  x P is true in a model m iff P with x being at
least one possible object in the model

 Equivalent to the disjunction of instantiations of


P
 At(Mike, KSU)  Smart(Mike) 
 At(Laurie, KSU)  Smart(Laurie) 
 At(Sarah, KSU)  Smart(Sarah) 
 …

March 2, 2006 AI: Chapter 8: First-Order Logic 14


Another Common Mistake to Avoid

 Typically,  is the main connective with 

 Common mistake: using  as the main


connective with 

  x At(x, KSU)  Smart(x)

March 2, 2006 AI: Chapter 8: First-Order Logic 15


Examples
 Everyone likes McDonalds
 x, likes(x, McDonalds)

 Someone likes McDonalds


 x, likes(x, McDonalds)

 All children like McDonalds


 x, child(x)  likes(x, McDonalds)

 Everyone likes McDonalds unless they are allergic to it


 x, likes(x, McDonalds)  allergic(x, McDonalds)
 x, allergic (x, McDonalds)  likes(x, McDonalds)

March 2, 2006 AI: Chapter 8: First-Order Logic 16


Properties of Quantifiers

 x y is the same as y x
 x y is the same as y x
 x y is not the same as y x
 x y Loves(x, y)
 “There is a person who loves everyone in the world”
 y x Loves(x, y)
 “Everyone in the world is loved by at least one person”

March 2, 2006 AI: Chapter 8: First-Order Logic 17


Nesting Quantifiers

 Everyone likes some kind of food


y x, food(x)  likes(y, x)
 There is a kind of food that everyone likes
x y, food(x)  likes(y, x)
 Someone likes all kinds of food
y x, food(x)  likes(y, x)
 Every food has someone who likes it
x y, food(x)  likes(y, x)

March 2, 2006 AI: Chapter 8: First-Order Logic 18


Examples

 Quantifier Duality
 Not everyone like McDonalds
(x, likes(x, McDonalds))
x, likes(x, McDonalds)

 No one likes McDonalds


(x, likes(x, McDonalds))
x, likes(x, McDonalds)

March 2, 2006 AI: Chapter 8: First-Order Logic 19


Fun with Sentences

 Brothers are siblings


x,y Brother(x,y)  Sibling(x, y)

 Sibling is “symmetric”
x,y Sibling(x,y)  Sibling(y, x)

March 2, 2006 AI: Chapter 8: First-Order Logic 20


Fun with Sentences

 One’s mother is one’s female parent


x,y Mother(x,y)  (Female(x)  Parent(x,y))

 A first cousin is a child of a parent’s sibling


x,y FirstCousin(x,y)  p,ps Parent(p,x) 
Sibling(ps,p)  (Parent(ps,y)

March 2, 2006 AI: Chapter 8: First-Order Logic 21


Other Comments About Quantification

 To say “everyone likes McDonalds”, the following is too


broad!
 x, likes(x, McDonalds)
 Rush’s example: likes (McDonalds, McDonalds)

 We mean: Every one (who is a human) likes McDonalds


 x, person(x)  likes(x, McDonalds)

 Essentially, the left side of the rule declares the class of


the variable x

 Constraints like this are often called “domain constraints”

March 2, 2006 AI: Chapter 8: First-Order Logic 22


Equality
 We allow the usual infix = operator
 Father(John) = Henry
 x, sibling(x, y)  (x=y)

 Generally, we also allow mathematical


operations when needed, e.g.
 x,y, NatNum(x)  NatNum(y) x = (y+1)  x > y

 Example: (Sibling in terms of Parent)


x,y Sibling(x,y)  [¬(x=y)  m,f ¬(m=f)  Parent(m,x)
 Parent(f,x)  Parent(m,y)  Parent (f,y)]

March 2, 2006 AI: Chapter 8: First-Order Logic 23


Interacting with FOL KBs
 Tell the system assertions
 Facts :
 Tell (KB, person (John) )
 Rules:
 Tell (KB,x, person(x)  likes(x, McDonalds))
 Ask questions
 Ask (KB, person(John))
 Ask (KB, likes(John, McDonalds))
 Ask (KB, likes(x, McDonalds))

March 2, 2006 AI: Chapter 8: First-Order Logic 24


Types of Answers

 Fact is in the KB
 Yes.
 Fact is not in the KB
 Yes (if it can be proven from the KB)
 No (otherwise)
 Fact contains variables
 List of bindings for which the fact can be proven,
e.g. ((x Fred) (x Mary) … )

March 2, 2006 AI: Chapter 8: First-Order Logic 25


Interacting with FOL KBs
 Given a Sentence S and a substitution s,

 Ss denotes the result of plugging s in to S;

 Example:
 S = Taller( x, y )
 s = {x/Mike, y/Laurie}
 Ss = Taller( Mike, Laurie )

 ASK(KB,S) returns some/all s such that KB |=Ss

March 2, 2006 AI: Chapter 8: First-Order Logic 26

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy