Scribd
Upload
18 views39 pages

Lec 3

The document provides an overview of knowledge representation techniques in expert systems, including rules, semantic nets, frames, and logic. It discusses key aspects of each technique such as the use of grammar with rules, the graph structure of semantic nets with nodes and arcs, the inheritance structure of frames, and the use of structured data and lists in Prolog. The document also provides examples to illustrate semantic nets, frames, and lists in Prolog.

Uploaded by

amrselim410
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
18 views39 pages

Lec 3

The document provides an overview of knowledge representation techniques in expert systems, including rules, semantic nets, frames, and logic. It discusses key aspects of each technique such as the use of grammar with rules, the graph structure of semantic nets with nodes and arcs, the inheritance structure of frames, and the use of structured data and lists in Prolog. The document also provides examples to illustrate semantic nets, frames, and lists in Prolog.

Uploaded by

amrselim410
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/ 39

Expert systems

by
Dr. Ayman Youssef
Researcher in electronics research institute
Previous lecture revision
• What is Expert system?
• How Expert system fits in AI.
• Expert systems components.
• Problem domain Vs knowledge domain.
• Expert systems history.
• Expert systems advantages.
• Characteristics of Expert systems
• Elements of Expert system.
• Appropriate domains of expert systems
• Knowledge representation.
Previous lecture revision
• What is logic? Types of Knowledge.
• Epistemology.
• Types of knowledge.
• Pyramid of knowledge.
• Example on the pyramid of knowledge.
Lecture outline
• Knowledge representation.
• Rules.
• Semantic nets.
• Semantic nets limitations.
• Attribute tables.
• Frame.
• Prolog (structured data, lists,..).
Knowledge representation
• A number of knowledge representations has been advised
-Rules
-Semantic nets.
-Frames.
-Logic
rules
• Uses grammar to describe
Semantic nets
• Semantic net is a labelled, directed graph.
• A semantic net also called propositional net.
• Semantic net are also called associative nets.
• A proposition is a statement that either true or false.
• Semantic nets consists of
- Nodes(objects, concepts, situations).
- Ares connecting them (expressing relations).
Semantic net
Semantic nets relations types
• ISA “is-a” relates an instantaneous or individual to a class
• KO “kind of”. Relates a generic class to a more general class.
Semantic nets example
Semantic net limitations
• One problem is lack of standardization for link names. Consider for
example a node named chair. Definitive knowledge?
Semantic nets in Prolog
OAV (Attribute value triple)
Frame Example
Generic Frame example
Car as a subframe of property
Instance of car frame
Disadvantages of frames
Elephant frame
Logic
Logic
Prolog revision
• Difference between facts and rules.
• Definition of family tree problem.
• Father rule, sister rule.
Defining a rule using
Recursion in Prolog
Recursive rules
Recursive rules
Prolog syntax
• There are two types of data in Prolog
1. simple data objects (atoms, numbers, variables)
2. structured objects.
Prolog syntax
• Atoms
• Strings of letters digits and the under score character,' -',
starting with a lower-case letter:
• anna
• alpha-beta-procedure
• miss_Jones
• sarahjones
Variables
• Variables are strings of letters, digits and under score characters. They
start with an upper-case letter or an underscore character:
•x
• Result
• Object2
• Participantlist
• _x23
• _23
Structures
Structures in prolog
Example
• vertical( seg( point(X,Y), point(X'Yl) ).
• horizontal( seg( point(X,Y), pornt(Xl,Y) ).
Lists in Prolog
Lists in Prolog
• member( b, [a,b,c] )
Lists in Prolog
• X is a member of L if either
(1) X is the head of L, or
(2) X is a member of the tail of L.

• member( X, [X I Tait] ).
• member( X, [Head I Taill ) :-
member( X, Tail).
Lists in Prolog
• conc( [X I L1], L2, [X I L3] ) :-
conc( L1, L2,L3).
Lists in Prolog
Thank You

You might also like