Design Method For Knowledge Base Systems in Education Using COKB-ONT

Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

World Academy of Science, Engineering and Technology 48 2008

Design Method for Knowledge Base Systems in


Education Using COKB-ONT
Nhon Do,Tuyen Trong Tran, Phan Hoai Truong

using COKB-ONT. It is also presented a case study, the


Abstract— Nowadays e-Learning is more popular, in Vietnam design of a knowledge base system that supports studying
especially. In e-learning, materials for studying are very important. knowledge and solving problems in higher mathematics.
It is necessary to design the knowledge base systems and expert
systems which support for searching, querying, solving of
problems. The ontology, which was called Computational Object
II.COMPUTATIONAL OBJECT KNOWLEDGE BASE
Knowledge Base Ontology (COB-ONT), is a useful tool for ONTOLOGY
designing knowledge base systems in practice. In this paper, a There are many methods for knowledge representation
design method for knowledge base systems in education using [2], [4], [9] and [14]. These methods are interested and
COKB-ONT will be presented. We also present the design of a
useful for many applications. However, they are not enough
knowledge base system that supports studying knowledge and
solving problems in higher mathematics. powerful and very difficult to use for constructing knowledge
base systems in different domains of knowledge. The
Keywords—artificial intelligence, knowledge base systems, Computational Object Knowledge Base Ontology (COKB-
ontology, educational software. ONT, [16]) and its models have been established from
Object-Oriented approach to represent knowledge together
I. INTRODUCTION with programming techniques for symbolic computation.

K NOWLEDGE representation has a very important role


in designing knowledge base systems (KBS) and expert
systems, especially those for education. There are many
There have been many results and tools for Object-Oriented
methods, and some principles as well as techniques were
presented in [15]. This way also gives us a method to model
various models and methods for knowledge representation problems and to design algorithms. The models are very
which have already been suggested and applied in many useful for constructing the components and the whole
fields of science. Ontology is a new method which gives us a knowledge base of knowledge base systems in education.
modern approach for designing knowledge components of
A. Components of the COKB model
KBS. However, practical applications of intelligent systems
expect more powerful and useful models for knowledge The model of computational object knowledge base
representation. In this paper, we will use the ontology, which (COKB model) consists of 6 components: (C, H, R, Ops,
is called Computational Object Knowledge Base Ontology Funcs, Rules). The meanings of the components are as
(COKB-ONT) [16], to produce an application in education follows:
and training. The COKB-ONT was used to produce many - C is a set of concepts of computational objects (C-
Object).
applications in education and training such as a program for
- H is a set of hierarchy relation on the concepts.
studying and solving problems in plane geometry presented
- R is a set of relations on the concepts.
in [6], a system that supports studying knowledge and
- Ops is a set of operators.
solving of analytic geometry problems presented in [7], and - Funcs is a set of functions.
a knowledge base system in linear algebra, etc. These - Rules is a set of rules.
programs must have suitable knowledge base. They not only Each concept in C is a class of C-objects. The structure C-
give human readable solutions but also present solutions as Objects can be modeled by (Attrs, F, Facts, Rules). Attrs is
the way teachers and students usually write them. The a set of attributes, F is a set of equations called computation
COKB-ONT includes models, specification language and relations, Facts is a set of properties or events of objects, and
deductive methods. It is the new and modern method which Rules is a set of deductive rules on facts. An object also has
is convenient for studying of users and for using by basic behaviors for solving problems on its attributes.
inference engine. Besides, problems are also modeled easily Objects are equipped abilities to solve problems such as:
so that we can design algorithms for solving problems 1. Determines the closure of a set of attributes.
automatically and propose a simple language for specifying 2. Executes deduction and gives answers for questions
them. COKB-ONT is a natural and reasonable tool for about problems of the form: determine some
designing knowledge bases. Nowadays, the COKB-ONT is attributes from some other attributes.
often used to represent knowledge in different domain such 3. Executes computations
as mathematics, physics, etc. In this paper, we will present a 4. Suggests completing the hypothesis if needed.
design method for knowledge base systems in education There are relations represent specializations between

162
World Academy of Science, Engineering and Technology 48 2008

concepts in the set C; H represents these special relations on domains of knowledge. The kinds of facts are as follows:
C. This relation is an ordered relation on the set C, and H - Fact of kind 1: information about object kind.
can be considered as the Hasse diagram for that relation. - Fact of kind 2: a determination of an object or an
R is a set of other relations on C, and in case a relation r is attribute of an object.
a binary relation it may have properties such as reflexivity, - Fact of kind 3: a determination of an object or an
symmetry, etc. In plane geometry and analytic geometry, attribute of an object by a value or a constant
there are many such relations: relation “belongs to” of a expression.
point and a line, relation “parallel” between two line - Fact of kind 4: equality on objects or attributes of
segments, relation “perpendicular” between two line objects. This kind of facts is also popular, and there
segments, the equality relation between triangles, etc. are many problems related to it on the knowledge
base.
The set Ops consists of operators on C. This component
- Fact of kind 5: a dependence of an object on other
represents a part of knowledge about operations on the
objects by a general equation.
objects. Almost knowledge domains have a component
- Fact of kind 6: a relation on objects or attributes of
consisting of operators. the objects. In almost problems there are facts of
The set Funcs consists of functions on C-Objects. kind 6 such as the parallel of two lines, a line is
Knowledge about functions is also a popular kind of perpendicular to a plane, a point belongs to a line
knowledge in almost knowledge domains in practice, segment.
especially fields of natural sciences such as fields of - Fact of kind 7: a determination of a function.
mathematics, fields of physics. - Fact of kind 8: a determination of a function by a
The set Rules represents for deductive rules. The rules value or a constant expression.
represent for statements, theorems, principles, formulas, and - Fact of kind 9: equality between an object and a
so forth. Almost rules can be written as the form “if <facts> function.
then <facts>”. In the structure of a deductive rule, <facts> is - Fact of kind 10: equality between a function and
a set of facts with certain classification. Therefore, we use another function.
deductive rules in the COKB model. Facts must be classified - Fact of kind 11: a dependence of a function on
so that the component Rules can be specified and processed other functions or other objects by an equation.
in the inference engine of knowledge base system or The above models and kinds of facts can be used to
intelligent systems. represent knowledge in practical applications. Unification
Base on the COKB model, the knowledge base can be algorithms of facts were designed and used in different
organized by the following components: applications.
1. The dictionary of concepts about kinds of objects, C. Specification Language for COKB model
attributes, operators, functions, relations and
The language for the COKB model is constructed to
related concepts.
2. The table of descriptions for structures and features represent the knowledge of the form COKB model. This
of objects. For example, we can request a triangle language includes the following:
to compute and to give us its attributes. - A set of characters: letter, number, special letter.
3. The tables for representing hierarchical relations of - Vocabulary: keywords, names.
concepts. - Data types: basic types and structured types.
4. The tables for representing other relations of - Expressions and sentences.
concepts. - Statements.
5. The tables for representing knowledge about - Syntax for specifying the components of COKB
operators. model.
6. The tables for representing knowledge about
functions. III. DESIGN METHOD
7. The tables of descriptions for kinds of facts. For In this section, we will present a process to construct a
example, a relational fact consists of kind of the knowledge base system for solving some problems in higher
relation and the list of objects in the relation. mathematics. Besides, techniques in each phase will be
8. The tables of descriptions for rules. For example, a presented also.
deductive rule consists of hypothesis part and
conclusion part. Both of them are lists of facts. A. Structure of System
9. The lists or sets of rules. A system, which supports searching, querying and solving
10. The lists of problem patterns. higher mathematics problem, has the structure of an expert
B. Kinds of facts in COKB model system. We can design the system which consists of six
components:
In the COKB model there are 11 kinds of facts accepted.
- The knowledge base.
These kinds of facts have been proposed from the - The inference engine.
researching on real requirements and problems in different

163
World Academy of Science, Engineering and Technology 48 2008

- The explanation component. of COKB model).


- The working memory. - The file OPERATORS.txt and the file
- The knowledge manager. OPERATORS_DEF.txt store the specification of
- The interface. operators (the component Ops of COKB model).
The figure 1 below shows the structure of the system. - The files FUNCTIONS.txt and FUNCTIONS_DEF.txt
store the specification of functions (the component
Funcs of COKB model).
Explaining - The file FACT_KINDS.txt stores the definition of
Part
kinds of facts.
User - The file RULES.txt stores deductive rules.
Interface Deduction
Working - The file SOMEOBJECTS.txt stores certain objects.
Engine
Memory Stage 4: Modeling of problems and designing algorithms.
Problems are represented using a model that is called
networks of C-Objects. It consists of three sets below.
Knowledge O = {O1, O2, . . ., On},
Engineer Knowledge
Knowledge F = {f1, f2, . . ., fm},
Manager
Base Goal = { g1, g2, . . ., gm }.
In the above model the set O consists of n C-objects, F is
Fig. 1 Structure of system the set of facts given on the objects, and Goal consists of
goals.
The Knowledge Base contains the knowledge for solving The design of deductive algorithms for solving problems
some problems in a specific knowledge domain. and the design of interface of the system can be developed
The Inference engine will use the knowledge stored in by three steps for modeling:
knowledge base to solve problems, to search or to answer for Step 1: Classify problems such as problems as frames,
the query. It must identify problem and use suitable problems of a determination or a proof of a fact,
deductive strategies to find out right rules and facts for problems of finding objects or facts, etc…
solving the problem. Step 2: Classify facts and representing them based on the
The working memory stores the facts and rules in the kinds of facts of COKB model.
process of searching and deduction. Step 3: Modeling kinds of problems from classifying in
The explanation component supports to explain the step 1 and 2. From models of each kind, we can
phases, concepts in the process of solving the problem. construct a general model for problems, which are
The knowledge manager aims to support updating given to the system for solving them.
knowledge into knowledge base. It also supports to search The basic technique for designing deductive algorithms is
the knowledge and test consistence of knowledge. the unification of facts. Based on the kinds of facts and their
The interface component of the system is required to have structures, there will be criteria for unification proposed.
a specification language for communication between the Then it produces algorithms to check the unification of two
system and learners, between the system and teachers as facts.
well. The next important work is doing research on strategies
B. Design Technique for deduction to solve problems on computer. The most
The process of analysis and design the components of the difficult thing is modeling for experience, sensible reaction
systems consists of the following stages. and intuitional human to find the heuristics rules, which
Stage 1: Collecting real knowledge based on COKB-ONT were able to imitate the human thinking for solving
model. problems.
Stage 2: Classifying the knowledge in the Stage 1, to Stage 5: Creating a query language for the model. The
analyze requirements. language helps to design the communication between the
Stage 3: Establishing knowledge base organization for the system and users by words.
system based on COKB-ONT model and its specification Stage 6: Designing the interface of software and
language. Knowledge base can be organized by structured programming the software. Our application has been
text files. They include the files below. implemented by using programming tools and computer
- The file OBJECT_KINDS.txt stores names of algebra systems such as Visual Basic.NET or C#, SQL
concepts. Ser ver. They are very easy to use for students, to search,
- The file HIERARCHY.txt stores information of the query and solve automatically problems.
Hasse diagram representing for the component H of Stage 7: Testing, maintaining and developing the
COKB model. application. This stage is similar as in other computer
- The files RELATIONS.txt and RELATIONS_DEF.txt systems.
store the specification of relations (the component R

164
World Academy of Science, Engineering and Technology 48 2008

IV. CASE STUDY: DESIGN PARTERN – A • Derivation: derivation at a point, one-sided derivation at
KNOWLEDGE BASE SYSTEM FOR QUERYING one point, derivation in a range, derivation of inverse
KNOWLEDGE OF HIGHER MATHEMATICS function, high derivative, etc.
The software can support for searching, querying and • Differential: differential invariant, differential at a point,
solving some problems in higher mathematics. The first differential on a range, primary differential, advance
function of the program is "Search for Knowledge". This differential, etc.
function helps users to find out necessary knowledge • Initial function: complete primitive, primitive function
quickly. It can search for concepts, definitions, properties, calculus, etc.
related theorems or formulas, and problem patterns. Users • Integral: integral formula, integral domain,
declare some information base on a simple language. The indeterminate integral, determinate integral, generalized
integral with infinite bound (type 1 generalized integral),
information can consist of objects, relations between objects
generalized integral of unbound function (type 2
or between attributes. The program can automatically give
generalized integral), integrate by parts, etc.
instructions that help them to know more about the problem.
• Theory of series: series, convergent series, positive
The second function of the program is “Query for
series, negative series, alternate series, random series,
Knowledge”. This function helps users to query knowledge series of functions, domain of convergence of series of
based on the query language which is a very simple functions, convergence of series of functions,
language. exponential series, radius of convergence of exponential
Stage 1: Collecting real knowledge based o n COKB- series, Taylor's series of a function f(x) at adjacent point
ONT model. x0., trigonometric series, Fourier’s series, Fibonacci
The knowledge of higher mathematics consists of the series, etc.
following components. B. List of properties: properties of series of convergence,
A. Concepts: bounded, order, etc.
• Numeric representation: natural numbers, integers, real C. List of formulas: Natural limit of series, Formulas for
numbers, complex numbers, etc. power function, Formulas for Logarithmic function,
• Category of sets: collection, Venn diagram, set Taylor formula, MacLaurin’s theorem, L’Hospital rule,
operatoions, etc. Derivation table, Cauchy-Schwarz’s inequality,
• Mapping: map, injection, surjection, bijection, identity Newton-Leibnitz formula, etc.
mapping, inverse mapping, etc. D. List of computing method: Function exploration,
• Sequence of numbers: sequence, bounded sequence, computing method of undetermined integral: analysis
bounded below sequence, bounded above sequence, method, variable method, partial method, computing
Cauchy’s sequence, monotone sequence, Fibonacci method of determined integral: analysis method,
sequence, pseudo random number sequence, strictly variable method, partial method finding radius
decreasing sequence, convergent sequence of function, convergence of power series, etc.
convergence monotone sequence, double sequence, null E. List of theorems: Infinitesimal and infinitely great
sequence, decreasing sequence, random number theorem, Continuity theorem of function: Weierstrass1
sequence, strictly increasing sequence, limit of a theorem, Weierstrass2 theorem, Theorem of derivation,
sequence, etc. Mean theorem: Fermat, Rolle, Lagrange, Cauchy,
• Real function with one variable: function, domain of a L’Hospital 1 and L’Hospital 2 Theorems for function
function, the range of a function, arithmetic function, exploration, Theorem for initial function and integral,
even function, odd function, doubly periodic function, Series theorem, etc.
monotone function, polynomial, rational function, F. Some applications of simply analytic function:
composite function, inverse function, reversible geometric meaning of derivation, application of
function, complex function, power function, determinate integral, etc.
exponential, Logarithmic function, trigonometric Stage 2: Classifying the k n o w l e d g e in the Stage 1, to
functions, inverse trigonometric functions, limit of a analyze requirements.
function, one-sides limit, limit of composite function, • Basic concept: numeric representation, collection.
limit of monotone function, infinitesimal, infinitely • Concepts are constructed from other concepts. For
great, continuity of function, continuous function at one example: Map: collection; Function: map; Limit of
point, one-sided continuous function, continuous series: series; Limit of function: function, limit of series;
function in a range, piecewise continuous function, point Chart of function: function, point; Derivation: function,
of discontinuity of function, function chart, maximum of limit of function; derivatives of higher order: derivation;
a function, minimum of a function, concave of function, Differential: function, derivation; Initial function:
convexity of function, bending point of function chart, function, derivation; Integral: function, initial function;
approximations of function chart, tangent line of Series: array of number; Positive series: series;
function chart, etc. Alternative series: series; Series of functions: series,
functions; Power series: series of functions; etc.

165
World Academy of Science, Engineering and Technology 48 2008

• Concepts are inherited from other concepts. For end_Relations


Example:
example: Injection: map; Surjection: map; bijection: begin_Relations
map; Identity mapping: map; Function: map; etc. [CONSTRUCTION, COLLECTION, MAP],{}
• Attribute of concept. For example: Collection: number [CONSTRUCTION, COLLECTION, FUNCTION],{}
of element; Function: domain of determinacy, range of [INHERITANCE, INJECTION, MAP],{}
[INHERITANCE, SURJECTION, MAP],{}
values; Chart of function: approximation, bend point; [INHERITANCE, BIJECTION, MAP],{}
Power series: interval of convergence, radius of [INHERITANCE, SERIES, ARRAY],{CONVERGENCE, DIVERGENCE}
convergence; etc. [INHERITANCE, FUNCTION_POWER, FUNCTION],{ODD_EVEN}
• Property of concept. For example: Collection: infinity, ...
end_Relations
finite, empty; Series: ascending, descending, - The files OPERATORS.txt and OPERATORS_DEF.txt
convergence, divergence; Function: ascending, store the specification of operators (the component Ops
descending, even, odd, convex, concave; etc. of COKB model).
• Operations on concepts. For example: arithmetic begin_object: <Object name>
operations, collection operations, etc. begin_variables
• Computing for functions. For example: limit of series, <attribute 1>
<attribute 2>
limit of function, inverse function, continuity of ...
function, derivation, differential, initial function, end_ variables
integral, etc. begin_contains
Stage 3: Establishing knowledge base organization for the <path to file which stores object content>
end_contains
system based on COKB-ONT model and specification end_object
language. Knowledge base can be organized by structured Example:
text files. They include the files below. COLLECTION.txt:
- The file OBJECT_KINDS.txt stores names of concepts. begin_object: COLLECTION
begin_Objects begin_variables:
<object name > n: NUMBER_OF_ITEM
<object name> A: ARRAY#LIST_OF_ITEM
... end_variables
end_Objects begin_contains
Example: \Contains_Object\COLLECTION
begin_Objects end_contains
COLLECTION end_object
MAP MAP.txt:
SERIES begin_object: MAP
FUNCTION begin_variables:
DERIVATION X: COLLECTION_SOURCE
INITIAL_FUNCTION Y: COLLECTION_DESTINATION
... end_variables
end_Objects begin_contains
\Contains_Object\MAP
- The file HIERARCHY.txt stores the Hasse diagram end_contains
representing for the component H of COKB model. end_object
begin_Hierarchy ....
[<high-order object>, <low-grade object>] - The files FUNCTIONS.txt and FUNCTIONS_DEF.txt
[<high-order object>, <low-grade object>]
...
store the specification of functions (the component Funcs
end_Hierarchy of COKB model).
Example: Begin_Functions
begin_Hierarchy Begin_Function <name of function>([<list of arguments>])
INJECTION, MAP <argument>:<kind>
SURJECTION, MAP Return <variable result>:<kind>
BIJECTION, MAP Begin_description
IDENTITY_MAPPING, MAP <path to the file which describes function>
POWER_FUNCTION, FUNCTION End_description
EXPONENTIAL, FUNCTION End_Function
LOGARIT_FUNCTION, FUNCTION Begin_Function <name of function>([<list of arguments>])
POSITIVE_SERIES, SERIES <argument>:<kind>
FUNCTIONS_SERIES, SERIES Return <variable result>:<kind>
... Begin_description
end_Hierarchy <path to the file which describes function>
- The files RELATIONS.txt and RELATIONS_DEF.txt End_description
End_Function
store the specification of relations (the component R of ...
COKB model). End_Functions
begin_Relations Example:
[<relation name>,<object 1>,<object 2>],{<behavior>,< behavior >,...} Begin_Functions
[<relation name>,<object 1>,<object 2>],{<behavior>,< behavior >,...} Begin_Function INVERSE_FUNCTION(y)
... y: FUNCTION

166
World Academy of Science, Engineering and Technology 48 2008

Return f: FUNCTION #f is the inverse function of y - The file SOMEOBJECTS.txt stores certain objects.
Begin_description Stage 4: Modeling for problems and designing
\Contains_Object\INVERSE_FUNCTION
End_description algorithms. Problems are represented using a model that is
End_Function called networks of C-Objects.
Begin_Function LIMIT_OF_ARRAY(d) The design of deductive algorithms for solving
d: ARRAY
Return a: REAL problems and the design of interface of the system can
Begin_description be developed by three steps for modeling:
\Contains_Object\ LIMIT_OF_ARRAY Step 1: Classify problems such as problems as
End_description frames, problems of a determination or a proof of a
End_Function
etc. fact, problems of finding objects or facts, etc.
End_Functions Step 2: Classify facts and representing them based
- The file FACT_KINDS.txt stores the definition of kinds on the kinds of facts of COKB model.
of facts. Step 3: Modeling kinds of problems from
Begin_Methods classifying in step 1 and 2. From models of each
Begin_Method < name of method> kind, we can construct a general model for
Begin_description
<path to the file which describes method> problems, which are given to the system for solving
End_description them.
End_Method The basic technique for designing deductive algorithms
Begin_Method <name of method> is the unification of facts. Based on the kinds of facts
Begin_description
<path to the file which describes method> and their structures, there will be criteria for unification
End_description proposed. Then it produces algorithms to check the
End_Method unification of two facts.
... The next important work is doing research on strategies
End_Methods
Example: for deduction to solve problems on computer. The most
Begin_Methods difficult thing is modeling for experience, sensible
Begin_Method INDETERMINATE_FORM_ELIMINATION reaction and intuitional human to find the heuristics
Begin_description rules, which were able to imitate the human thinking
\Contains_Object\
INDETERMINATE_FORM_ELIMINATION for solving problems.
End_description Stage 5: Creating a query language for the COKB-ONT.
End_Method There are eight of simple query kinds and one of combine
Begin_Method FUNCTION_EXPLORATION_PROCESS
query kind:
Begin_description
\Contains_Object\ FUNCTION_EXPLORATION_PROCESS • Kind 1: ?concepts|define <concept>
End_description Example:
End_Method ?concepts COLLECTION
...
End_Methods
?define FUNCTION
- The file RULES.txt stores deductive rules. • Kind 2: ?attributes <concept>
Begin_Rules Example: ?attributes COLLECTION
Begin_Rule <Rule name>:<kind of rule> • Kind 3: ?properties <concept>
Variables:
<object>:<kind> Example: ?properties CONVERGENCE_ARRAY
<object>:<kind> • Kind 4: ?formula <concept>
... Example: ?formula LIMIT_OF_ARRAY
Begin_description
< path to the file which describes rules> • Kind 5:
End_description a)?theorems <concept>
Goal: Example: ?theorems DERIVATE
<result of using rule> b) ?theorems <concept1, concept2,...>
End_Goal
End_Rule Example: ?theorems FUNCTION, DERIVATE
Begin_Rule <Rule name>:<kind of rule> c) ?content <name of theorem>
Variables: Example: ?content WEIERSTRASS_THEOREM
<object>:<kind> • Kind 6: ?methods <concept>
<object>:<kind>
... Example: ?methods LIMIT_OF_FUNCTION
Begin_description • Kind 7: ? concepts_related <concept>
< path to the file which describes rules> Example: ? concept_object FUNCTION
End_description
Goal:
 Kind 8: querying of many kind (kind 2 to kind 7)
<result of using rule> q → kind 1..7
End_Goal kind 8 → q1 and q2
End_Rule | kind 81 and kind 82
...
End_Rules Example:

167
World Academy of Science, Engineering and Technology 48 2008

(? define LIMIT_OF_FUNCTION) and Plane Geometry, Proceedings of International Conference on Artificial


Intelligence 2000, Las Vegas, USA, 2000, pp. 1441-1447.
(? properties LIMIT_OF_FUNCTION)
[7] Do Van Nhon, A system that supports studying knowledge and solving
Annotation: All of concepts which is queried by of analytic geometry problems, 16th World Computer Congress 2000,
using kinds of the query sentences, are in Proceedings of Conference on Education Uses of Information and
Objects.txt. Communication Technologies, Beijing, China, 2000, pp. 236-239.
[8] Asunción Gómez-Pérez & Mariano Férnandez-López & Oscar Corcho,
Stage 6: Designing the interface of software and
Ontological Engineering. Springer-Verlag, 2004.
programming the software. Our application has been [9] Chitta Baral, Knowledge Representation, Reasoning and Declarative
implemented by using programming tools and computer Problem Solving, Cambridge University Press, 2003.
algebra systems such as Visual Basic.NET or C#, SQL [10] Guarino, N. Formal Ontology, Conceptual Analysis and Knowledge
Representation, International Journal of Human-Computer Studies,
Ser ver. They are very easy to use for students, to search, 43(5-6):625–640, 1995.
query and solve automatically problems. [11] Wen-tsun Wu, Mechanical Theorem Proving in Geometries. Springer-
Stage 7: Testing, maintaining and developing the Verlag, 1994.
[12] Chou, S.C. & Gao, X.S. & Zhang, J.Z. Machine Proofs in Geometry.
application. This stage is similar as in other computer Singapore: Utopia Press, 1994.
systems. [13] Pfalzgraf, J. & Wang, D. Automated Practical Reasoning. New
York: Springer-Verlag, 1995.
[14] Lakemeyer, G. & Nebel, B. Foundations of Knowledge representation
V. CONCLUSION and Reasoning. Berlin Heidelberg: Springer-Verlag, 1994.
The design method using COKB-ONT provided a natural [15] Berge, J.M. & Levia, O. & Rouillard, J. Object-Oriented Modeling.
Netherlands: Kluwer Academic Publishers, 1996.
way for representing knowledge for a class of knowledge [16] Nhon Do, An ontology for knowledge representation And Applications.
base systems in education. We have designed the intelligent Waset, International Conference on Data, Information and Knowledge
educational software for e-learning. Main functions of the Management, Singapore, 2008.
software support for searching, querying and solving the Nhon Do is currently a senior lecturer in the faculty of Computer Science at
problems in higher mathematics. Certainly, this design the University of Information Technology, Ho Chi Minh City, Vietnam. He
method can be used for applications in different domains of got his M.Sc. and Ph.D. in 1996 and 2002 respectively, from The University
knowledge. of Natural Sciences – National University of Ho Chi Minh City. His
research interests include Artificial Intelligence, computer science, and their
practical applications, especially intelligent systems and knowledge base
REFERENCES systems.
[1] L. Stojanovic, J. Schneider, A. Maedche, S. Libischer, R. Suder, T. Tuyen Trong Tran is currently a senior lecturer in the faculty of
Lumpp, A. Abecker, G. Breiter, J. Dinger, The Role of Ontologies in Information Technology at the Binh Duong University, Binh Duong
Autonomic Computing Systems, TBM Systems Journal, Vol 43, No 3, Province, Vietnam. He got his M.Sc. in 2003 from The University of
2004. Natural Sciences – Viet Nam National University of Ho Chi Minh City.
[2] Stuart Russell & Peter Norvig, Artificial Intelligence – A modern His research interests include Computer science, Management Information
approach (second edition), Prentice Hall, 2003. System.
[3] John F. Sowa. Knowledge Representation: Logical, Philosophical and Phan Hoai Truong is currently a senior lecturer in the faculty of
Computational Foundations, Brooks/Cole, 2000. Economics and Law at the Vietnam University of Ho chi minh city. He got
[4] George F. Luger & William A Stubblefield, Artificial Intelligence, his M.Sc. in 2002 from The University of Natural Sciences – Viet Nam
Addison Wesley Longman, Inc. 1998. National University of Ho Chi Minh City. His research interests include
[5] Gruber, T. R., Toward Principles for the Design of Ontologies Used Computer science, Management Information System.
for Knowledge Sharing. International Journal Human-Computer
Studies, 43(5-6):907-928, 1995.
[6] Do Van Nhon, A Program for studying and Solving of problems in

168

You might also like