Scribd
Upload
212 views17 pages

Artificial Intelligence (Ai) - Knowledge Representation Schemes

The document discusses different knowledge representation schemes used in artificial intelligence systems, including semantic networks, frames, propositional logic, first-order predicate logic (FOPL), and rule-based systems. It provides facts and examples about each technique. Semantic networks represent knowledge as a graph with nodes for objects and arrows for relations. Frames organize information about an entity using slots and attribute-value pairs. Propositional and first-order logic use symbols and predicates to represent declarative statements and their relationships. Rule-based systems represent knowledge through if-then rules that can be used to infer new facts.

Uploaded by

teddy demissie
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
212 views17 pages

Artificial Intelligence (Ai) - Knowledge Representation Schemes

The document discusses different knowledge representation schemes used in artificial intelligence systems, including semantic networks, frames, propositional logic, first-order predicate logic (FOPL), and rule-based systems. It provides facts and examples about each technique. Semantic networks represent knowledge as a graph with nodes for objects and arrows for relations. Frames organize information about an entity using slots and attribute-value pairs. Propositional and first-order logic use symbols and predicates to represent declarative statements and their relationships. Rule-based systems represent knowledge through if-then rules that can be used to infer new facts.

Uploaded by

teddy demissie
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/ 17

ARTIFICIAL INTELLIGENCE (AI) -

KNOWLEDGE REPRESENTATION SCHEMES

Ruchi Sharma
ruchisharma1701@gmail.com
Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi
Contents

 Quick Recall – AI concept

 Knowledge Representation – Concept & Features

 Knowledge Representation - Techniques/Schemes

 Understanding Semantic Networks – Facts

 Understanding Semantic Networks – Examples

 Understanding Frames – Facts

 Understanding Frames – Examples

 Understanding Propositional Logic & FOPL – Facts

 Understanding Propositional Logic & FOPL - Examples

 Understanding Rule-based Systems - Facts

 Understanding Rule-based Systems - Examples


Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi
Quick Recall – AI Concepts

1. Artificial Intelligence deals with creating computer


systems that can
 simulate human intelligent behaviour in a
particular domain
 learn new concepts and tasks
 reason & draw conclusions
 learn from the examples & past related experience

2. A computer possessing artificial intelligence( an


expert system) has two basic parts
 Knowledge Base – containing the knowledge it
uses
 Inference-control unit – which facilitates the
appropriate & contextual use of KB

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Knowledge Representation – Concept & Features

Knowledge representation is a method used to code

knowledge in the knowledge base of an expert system.

An ideal knowledge representation scheme should


 have inferencing capability
 have a set of well defined syntax & semantics
 allow the knowledge engineer to express
knowledge in a language ( which can be inferred)
 allow new knowledge to be inferred from the basic
facts already stored in the KB

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Knowledge Representation – Techniques/Schemes

Different knowledge representation schemes are used

today among which the most common are

 Semantic Networks

 Frames

 Propositional logic & FOPL

 Rule-based system

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Semantic Networks - Facts

 A semantic network is a directed graph with labelled nodes &

arrows. Nodes are commonly used for objects & the arrows for

relations.

 The pictorial representation of objects, their attributes &

relationships between them & other entities make them better

than many other representation schemes.

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Semantic Networks – An example

Let us make a semantic net with the following piece of information

“Tweety is a yellow bird having wings to fly.”

Fact 1 : Tweety is a bird.

Fact 2 : Birds can fly.

Fact 3 : Tweety is yellow in color.

CAN fly

bird tweety yellow


A-KIND-OF COLOR

HAS-PARTS wings

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Frames – Facts

 Frames are record-like structures that have slots & slot-values for

an entity

 Using frames, the knowledge about an object/event can be stored

together in the KB as a unit

 A slot in a frame

 specify a characteristic of the entity which the frame

represents

 Contains information as attribute-value pairs, default values

etc.

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Frames - Examples

1. An example frame corresponding to the semantic net eg quoted


earlier
(Tweety
(SPECIES (VALUE bird))
(COLOR (VALUE yellow))
(ACTIVITY (VALUE fly)))

2. Employee Details
( Ruchi Sharma
(PROFESSION (VALUE Tutor))
(EMPID (VALUE 376074))
(SUBJECT (VALUE Computers)))

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Propositional Logic – Facts

 Symbolic logic is a formalized system of logic which employs

abstract symbols of various aspects of natural language.

 Propositional logic is the simplest form of the symbolic logic, in

which the knowledge is represented in the form of declarative

statements called propositions.

 Each proposition, denoted by a symbol, can assume either of

the two values – true or false.

Eg

P : It is raining.

Q: The visibility is low.

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Propositional Logic – Facts (Contd.)

 Propositions are also called formulas or well-formed-

formulas(wffs)

 Formulas can be atomic or compound

 Atomic formulas – elementary propositional sentences

 Compound formulas – formed from the atomic formulas

using logical connectives ( ^, V, !, ~, )

eg

R : It is raining and the visibility is low.

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Propositional Logic - Examples

1. If given the statements P, Q and S as :


P : It is raining.
Q : The visibility is low.
S : I can’t drive.
Then, the statement “It is raining and the visibility is low, so I
can’t drive.” will be formalized as
P^Q S
2. If given the statements P & Q as :
P : He needs a doctor.
Q : He is unwell.
we can conclude
Q P

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding First order predicate logic (FOPL)

 FOPL was developed to extend the expressiveness of

propositional logic.

 It works by breaking a proposition into various parts &

representing them as symbols.

 The symbolic structure includes

 individual symbols - some constants as names

 variable symbols – as x, y, a, b etc

 function symbols – as ‘product’

 predicate symbols – as P, Q etc

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding FOPL - Example

Given statements
P: Every bird can fly.
Q : Tweety is a bird.
R : Tweety can fly.

Using FOPL, lets define the following


B(x) for x is a bird.
F(x) for x can fly.

P : V(x) ((B(x) F(X))


Q : B(TWEETY))
R : v(x)(B(x) F(x)) ^ B(TWEETY) F(TWEETY)

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Rule-based System – Facts

 A Rule-based system represents knowledge in the form of a set of

rules .

 Each rule represents a small chunk of knowledge relating to the

given domain.

 A number of related rules along with some known facts

collectively may correspond to a chain of inferences.

 An interpreter(inference engine) uses the facts & rules to derive

conclusions about the current context & situation as presented

by the user input.

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Understanding Rule-based System – Example

Suppose a rule-based system has the following statements

R1 : If A is an animal and A lays no eggs, then A is a mammal.

F1 : Lucida is an animal.

F2 : Lucida lays no eggs.

The inference engine will update the rule base after interpreting the

above set as :

R1 : If A is an animal and A lays no eggs, then A is a mammal.

F1 : Lucida is an animal.

F2 : Lucida lays no eggs.

F3 : Lucida is a mammal.

Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi


Ruchi Sharma ruchisharma1701@gmail.com http://www.wiziq.com/tutor-profile/376074-Ruchi

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