Professional Documents
Culture Documents
CMJV02I03P0445
CMJV02I03P0445
CMJV02I03P0445
1. INTRODUCTION
A knowledge representation (KR) is
an idea to enable an individual to determine
consequences by thinking rather than acting,
i.e., by reasoning about the world rather than
taking action in it. There are two basic
components of knowledge representation i.e.
reasoning and inference2. Knowledge
representation (KR) and reasoning' is an area
of artificial intelligence whose fundamental
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
446
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
Procedural Knowledge
Hard to debug
Black box
Obscure
Process oriented
Extension may effect stability
Fast , direct execution
Declarative
Knowledge
Easy to validate
White box
Explicit
Data oriented
Extension is easy
Slow
(requires
interpretation)
May require high
level data type
Representations in
the
form
of
production system,
the entire set of
rules for executing
the task.
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
447
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
3. KNOWLEDGE REPRESENTATION
TECHNIQUES
4. KNOWLEDGE REPRESENTATION
USING LOGIC
Initial state.
Goal state.
Legal operators which are the things
allowed doing.
Operator restrictions.
103
types
of
Logic
representation)
First order logic (a mix of Propositional
and Predicate)
Temporal Logic
Fuzzy Logic
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
448
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
we
am
be
eat
x. ("there
Fuzzy Logic:
It is a form of many-valued logic
derived from fuzzy set theory to deal with
reasoning that is fluid or approximate rather
than fixed and exact. In contrast with "crisp
logic", where binary sets have two-valued
logic, fuzzy logic variables may have a truth
value that ranges in degree between 0 and 1.
In simple words we can say fuzzy logic is a
super set of conventional (Boolean) logic
that has been extended to handle the concept
of partial truth--the truth values between
completely true and completely false.8
5. SEMANTIC NET
The basic idea behind a semantic
network is that knowledge is often best
understood as a set of concepts that are
related to one another. The meaning of a
concept is defined by its relationship to other
concepts.
A semantic network consists of a set
of nodes that are connected by labeled arcs.
The nodes represent concepts and the arcs
represent relations between concepts.
Computer implementations of semantic
networks were first developed for artificial
intelligence and machine translation, but
earlier versions have long been used in
philosophy, psychology, and linguistics14.
Inheritance is most useful form of inference.
Inheritance is the property in which element
of some class inherit the attribute and values
from some other class as shown in Fig.1.
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
449
450
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
class.
Make node g an instance of GS.
Every element will have at least 2
attributes:
a form that states which relation is
being asserted.
one or more forall ( ) or there exists
( ) connections - these represent
universally quantifiable variables in
such statements e.g. (x,y) in
x: parent(x) y : child(y) loves(x,y)
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011))
Fig. 4
451
5.1.2 Frames
Frames are
descriptions
of
conceptual individuals. Frames can exist for
``real'' objects such as ``The Watergate
Hotel'', sets of objects such as ``Hotels'', or
more ``abstract'' objects such as ``Cola
``ColaWars'' or ``Watergate''. Frames are
essentially definedd by their relationships
with other frames. Relationships between
frames are represented using slots. If a frame
f is in a relationship r to a frame g, then we
put the value g in the r slot of f.
For example, suppose we are describing the
following genealogical tree:
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
580)
452
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011))
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
580)
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
5. "AITopics / Representation".
Association for the Advancement of
Artificial Intelligence.
http://www.aaai.org/aitopics/pmwiki/pm
wiki.php/AITopics/Representation.
Retrieved 23 March.
6. Rathke,
C.,
Object-oriented
programming and frame-based knowledge representation, 5th International
Conference, Boston, (1993).
7. Knowledge Representation TechniquesProf. Dr. Shaiq Haq, Mechatronics
Engineering,
AIR
University,
http://www.wecuw.edu.pk/downloads/ai
/06_AI_Lectureon_Knowledge_Represe
ntation_Techniques.pdf Islamabad.
8. Von Altrock, Constantin. Fuzzy logic
and NeuroFuzzy applications explained.
Upper Saddle River, NJ: Prentice Hall
PTR. ISBN 0-13-368465-2 (1995).
http://whatis.techtarget.com/definition/0,
,sid9_gci835674,00.html
9. http://en.wikipedia.org/wiki/Temporal_l
ogic.
10. Venema, Yde, "Temporal Logic," in
Goble, Lou, ed., The Blackwell Guide to
Philosophical Logic. Blackwell (2001).
11. E. A. Emerson and C. Lei, modalities for
model checking: branching time logic
strikes back, in Science of Computer
Programming 8, p 275-306, (1987).
12. E.A. Emerson, Temporal and modal
logic,
Handbook
of
Theoretical
Computer Science, Chapter 16, the MIT
Press, (1990).
13. Han Reichgelt, Knowledge Representation: An AI Perspective, Chapter
5 (Semantic Networks) and Chapter 6
(Frames).
14. Shetty, R.T.N., Riccio, P. M.,
Quinqueton, J., Hybrid Model for
15.
16.
17.
18.
19.
453
Knowledge Representation,
International
Conference on Volume 1, pp. 355 361,
(2006).
Author:
Robin
http://intelligence.
worldof computing.net /knowledgeRepresentation /frames.html, October
7th, 2010
Semantic Networks BY John F. Sowa
http://www.jfsowa.com/pubs/semnet.
htm
Extending Semantic Nets, Dave.Marshall
(UK)
http://www.cs.cf.ac.uk/Dave/AI2/subsub
section3_8_2_3.html
Frame
knowledge
Representation,
Micheal S. Hewett http://www.cs.
utexas.edu/users/qr/algy/algy-expsys/
node3.html.
Comparative Study of Three Declarative
Knowledge Representation TechniquesPoonam Tanwar Asst. Professor, Dept.
of
CSE,
Lingayas
University,
Faridabad,
Haryana,
India,
Dr.
Mahendra. S. Aswal I/c Computer
Center.
Lecture notes on Predicate logic.
http://www.cs.odu.edu/~toida/nerzic/con
tent/logic/pred_logic/inferen
ce/infer_intro.html
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
454
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
at www.cc.ee.ntu.edu.tw/~skjeng/
Representation.ppt.
28. Presentation
on
Knowledge
representation and rule based systems,
available at
www.arun555mahara.files.wordpress.com/
2010/02/knowledgerepresentation.ppt.
29. Presentation on Various knowledge
representation techniques, available at
http://www.ee.pdx.edu/~mperkows/CLA
SS_ROBOTICS/FEBR19/019.representation.ppt
30. Syed S. Ali, and Lucja Iwanska,
Knowledge representation for natural
language processing in implemented
system, Natural Language Engineering,
3:97-101, Cambridge University Press,
(1997).
Annexure 1
Table 2: Comparison between Predicate Logic, Semantic Net and Frame
S.
Knowledege/
no
Strucutre
Invented by
Predicate Logic
Semantic Network
Frames
Ackermann Richard H.
Wilhelm
2
Year
1928
Nearest Data
Rule
Structure
4
Merits
1956
Based
1975
Graph
System
1. Its provide a
better way to do
reasoning by
providing a way
of deducing new
from old one.
2.It can be used for
proving the
statements.
3. Quantified and
Existential
Relationships handled by
Pointers.
statements are
easily represented.
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
5
Demerits
1.Less expressive.
2.Used for
representing statics
Facts only.
3.Predicate logic is
not useful for
difficult.
1. No associated reasoning/inference
mechanisms.
2 .Lack of semantics.
3. Expressive limitations.
representing facts
like degree of
hearts/ certainty,
heuristic
a specific Student
information.
Searching
1.Breadth First.
1. Intersection Search.
1 Inheritance.
Algorithms
2.Depth First.
2 .Inheritance.
3.Chaining
3.Breadth First.
Forward
4 .Depth First.
Backward
5 .Heuristic search
Type
Declarative
Declarative
Declarative/Procedural
Software
1 Prolog
1 KM (Knowledge Machine)
2 Lisp
2 Frame Talk
1. First order
predicate logic
2 .Neural Networks
2. Second order
3 Loom
9
Variants
predicate logic
Oriented Net
Declarative frames
Prodecular frames
3. Many-sorted
logic
4 Infinitely logic
(wff)
5. Annotated
predicate logic
6. Predicate
calculus
10
Applications
1. Inductive
reasoning (For
drawing
1. Practical knowledge
representation for the Web.
2 .Semantic modeling and
conclusion)
knowledge representation in
2 . Deductive
Multimedia Database.
reasoning ( For
drawing
logical
conclusion
3. Machine
Learning.
6 .Machine learning
4. Natural
language
processing.
another.
5 In Natural language processing.
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)
455
456
11
Anshu Shrivastava, et al., J. Comp. & Math. Sci. Vol.2 (3), 445-456 (2011)
Example
"
(x) :
Father( Bill , x)
Mother
( Hillary , x)
and
the
that
is
the
mother of x.
12
Example
(x) : Father
(Bill , x )
Mother ( Hillary ,
x)
There is a kid
whose father is
Bill and whose
mother is Hillary
There exist a chid
whose father is
bill and
whose
mother is Hillary
13
References
[1][2][3][21][23][24]
[1][2][3][12][16][25][26][27][30]
[16] [19][20][23][[27][28][30]
Journal of Computer and Mathematical Sciences Vol. 2, Issue 3, 30 June, 2011 Pages (399-580)