Design of Layers in Knowledgebase for Expert Systems

Similar documents
Chapter 2 & 3: Representations & Reasoning Systems (2.2)

Automation of Semantic Web based Digital Library using Unified Modeling Language Minal Bhise 1 1

V. Thulasinath M.Tech, CSE Department, JNTU College of Engineering Anantapur, Andhra Pradesh, India

Data Cleaning in Text File

Introduction to Lexical Analysis

Transforming Requirements into MDA from User Stories to CIM

Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur

Resolution in FO logic (Ch. 9)

Functional Dependency: Design and Implementation of a Minimal Cover Algorithm

Tracing down Black hole attack in MANETS

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Compiler Design

COMP4418 Knowledge Representation and Reasoning

H1 Spring B. Programmers need to learn the SOAP schema so as to offer and use Web services.

CHAPTER 5 SEARCH ENGINE USING SEMANTIC CONCEPTS

1DL321: Kompilatorteknik I (Compiler Design 1) Introduction to Programming Language Design and to Compilation

1DL321: Kompilatorteknik I (Compiler Design 1)

A Survey On Different Text Clustering Techniques For Patent Analysis

Back to the knights and knaves island

An Overview of Projection, Partitioning and Segmentation of Big Data Using Hp Vertica

Novel Hybrid k-d-apriori Algorithm for Web Usage Mining

FUZZY SQL for Linguistic Queries Poonam Rathee Department of Computer Science Aim &Act, Banasthali Vidyapeeth Rajasthan India

ADMINISTRATIVE MANAGEMENT COLLEGE

Graph Representation of Declarative Languages as a Variant of Future Formal Specification Language

Semantic Web Test

Introduction to Lexical Analysis

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 37 Resolution Rules

1. true / false By a compiler we mean a program that translates to code that will run natively on some machine.

Representing Product Designs Using a Description Graph Extension to OWL 2

1DL321: Kompilatorteknik I (Compiler Design 1) Introduction to Programming Language Design and to Compilation

Hiperspace: The Forgotten Giant of Mainframe Storage

Syntax and Grammars 1 / 21

Propositional Logic Formal Syntax and Semantics. Computability and Logic

Business Rules in the Semantic Web, are there any or are they different?

The Logic Paradigm. Joseph Spring. 7COM1023 Programming Paradigms

Introduction to Programming Languages and Compilers. CS164 11:00-12:30 TT 10 Evans. UPRM ICOM 4029 (Adapted from: Prof. Necula UCB CS 164)

Nigerian Geography Ontology for Semantic Web Applications

Review on Text Mining

A Survey Of Different Text Mining Techniques Varsha C. Pande 1 and Dr. A.S. Khandelwal 2

IJRIM Volume 2, Issue 2 (February 2012) (ISSN )

Logic: TD as search, Datalog (variables)

Flexible Tools for the Semantic Web

CS101 Introduction to Programming Languages and Compilers

Principles of Knowledge Representation and Reasoning

Intelligent Agent based Mapping of Software Requirement Specification to Design Model

SQL for Palm Zhiye LIU MSc in Information Systems 2002/2003

Identifying the Type of Face To Face Connection from STEP AP203 File

Jan Vanthienen. Research and teaching: KU Leuven (Belgium) Leuven Institute for Research in Information Systems

a. Given that we search depth first from left to right, list all leaf nodes above that we need to search/expand. (35 Points)

Contents. G52IWS: The Semantic Web. The Semantic Web. Semantic web elements. Semantic Web technologies. Semantic Web Services

Reasoning With Characteristic Models

user.book Page 45 Friday, April 8, :05 AM Part 2 BASIC STRUCTURAL MODELING

Chapter 3. Describing Syntax and Semantics

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms

XML Schema Language Specifications for Conditional Knowledge

Role of Fuzzy Set in Students Performance Prediction

Churn Prediction Using MapReduce and HBase

ARTIFICIAL INTELLIGENCE (CS 370D)

Computer Science Applications to Cultural Heritage. Relational Databases

Android based Attendance Management System Offline and Online accessibility

USING DECISION MODELS METAMODEL FOR INFORMATION RETRIEVAL SABINA CRISTIANA MIHALACHE *

A prototype system for argumentation-based reasoning about trust

Heart Disease Detection using EKSTRAP Clustering with Statistical and Distance based Classifiers

A New Algorithm for Shape Detection

Library resources in philology

Comparison Between Dynamic And Static Blocks In Sequitur Algorithm

Answers. The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 3 MODULE, AUTUMN SEMESTER KNOWLEDGE REPRESENTATION AND REASONING

Knowledge Representation

Natural Language to Database Interface

Vimal P. Parmar Research Scholar, Dept. of Comp. Science Saurashtra University, Rajkot Gujarat, India

Lecture 17 of 41. Clausal (Conjunctive Normal) Form and Resolution Techniques

Introduction to Sets and Logic (MATH 1190)

Extracting knowledge from Ontology using Jena for Semantic Web

Inverted Index for Fast Nearest Neighbour

Database Applications (15-415)

Database Applications (15-415)

Lecture 4: January 12, 2015

Knowledge Representation. CS 486/686: Introduction to Artificial Intelligence

NLP - Based Expert System for Database Design and Development

INTRODUCTION TO DATABASE

11. a b c d e. 12. a b c d e. 13. a b c d e. 14. a b c d e. 15. a b c d e

SAT BASED ALGORITHMIC APPROACH FOR SUDOKU PUZZLE

Enhanced Entity- Relationship Models (EER)

Knowledge representation and reasoning Lecture 1: Introduction

Lexical Analysis. COMP 524, Spring 2014 Bryan Ward

TEXT PREPROCESSING FOR TEXT MINING USING SIDE INFORMATION

International Journal of Software and Web Sciences (IJSWS)

! " # Formal Classification. Logics for Data and Knowledge Representation. Classification Hierarchies (1) Classification Hierarchies (2)

An Improved Document Clustering Approach Using Weighted K-Means Algorithm

Efficient Algorithms for Preprocessing and Stemming of Tweets in a Sentiment Analysis System

A Tool for Storing OWL Using Database Technology

Compiler Design 1. Introduction to Programming Language Design and to Compilation

LITERATURE SURVEY ON SEARCH TERM EXTRACTION TECHNIQUE FOR FACET DATA MINING IN CUSTOMER FACING WEBSITE

Efficient Querying of Web Services Using Ontologies

Review of Fuzzy Logical Database Models

Implementing Knowledge based Band Management Tool

CSE 20 DISCRETE MATH. Fall

Chapter 9: Constraint Logic Programming

Defining Program Syntax. Chapter Two Modern Programming Languages, 2nd ed. 1

Study of Fuzzy Set Theory and Its Applications

COMPUTATIONAL SEMANTICS WITH FUNCTIONAL PROGRAMMING JAN VAN EIJCK AND CHRISTINA UNGER. lg Cambridge UNIVERSITY PRESS

Transcription:

IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 3, Ver. V (May-Jun. 2016), PP 89-93 www.iosrjournals.org Design of Layers in Knowledgebase for Expert Systems Yugandhara A. Nimbalkar 1, Dr. Justus S 2 1,2 School of Computer Science and Engineering VIT University Chennai, India Abstract: In any Expert System, Knowledge is the basic functional unit for building a knowledgebase [1]. Hence, Expert Systems are totally/partially depended on Knowledge bases for its intelligent functionality. In our proposed design of Knowledgebase, we have divided it into 3 layers: Logical or Design Layer, Knowledge Layer and Storage Layer.In Logical layer or Design layer a high-level statement or a file is the input, which is processed, and clauses (functional & predicate symbols) are extracted [3]. These will form the basic unit for designing a knowledge unit (KU). These KUs are validated for their scope with identified relations. Then we will create various set of domain-dependent predicates and functions to represent the Knowledge in the Knowledge layer. This representation will be converted to Object Relational Database and will be stored in Storage Layer [2]. Researchers working in design and development of Knowledgebase will be benefitted by this. I. Introduction Data is the collection of raw facts. The facts or the data about the world are put into Knowledgebase. Knowledgebase can be used to infer to various facts of the world with their proper reasoning. We use these facts, some logic rules and other logic forms to deduce new facts. We can also provide the inconsistencies of some facts available in knowledgebase. The Knowledgebase in Experts Systems are layered as follows: Design or Logical Layer, Knowledge Layer and Storage Layer. Design or Logical Layer gets its input from Knowledge Acquisition phase is completed by extracting the data or the raw facts from one source usually human experts and then organizing and storing this data. The next layer is an intelligent layer of the system-knowledge Layer. In this layer, new facts are deduced from the existing facts and also some inconsistencies can be deduced from them. The third and the last layer of the system is Storage Layer. The extracted facts in acquisition phase are classified into types: Predicate Symbols, Functional Symbols and connectives. These symbols are then stored in the form of Object Relational Database Systems in the Storage Layer. All these symbols together form Ontology for an Organization. Figure 1.Knowledge Management System II. Related Work Three layered Database Management Systems is compared with Knowledge Management Systems and many similarities are found between their concepts. The Presentation Layer of the Database Management System can be compared with Design Layer of Knowledge Management System. In Knowledge Management Systems, Design Layer acts as an interface between the system and user while in Database Systems, Presentation Layer acts as interface [1]. Similarly, Application layer of DBMS is used to perform operations while Knowledge layer of KMS is used to deduce new facts from existing ones. Both Storage layer and Database layer of KMS and DBMS are used to store the knowledge and data. In the design layer of the KMS, knowledge is acquired from various trusted sources such as Experts in that particular field, various Magazines and Journals, meetings and Forums. The knowledge collected is then classified and stored. This knowledge can later be updated by Experts when needed using the concept of Knowledge Reuse [5]. Refer Figure 2. DOI: 10.9790/0661-1803058993 www.iosrjournals.org 89 Page

III. Proposed Work The entire work is divided into three phases, each associated with the three layers of the KB. In this work we are focusing on the first layer the design layer. The phases involved in the design of any Knowledge Management System are: 1. Knowledge Acquisition 2. Knowledge Representation 3. Knowledge Storage & Retrieval 4. Knowledge Sharing 5. Knowledge ReuseRefer Figure 3. A. Knowledge Acquisition Knowledge Acquisition is done in the Design Layer of the KMS model. The functions of the design layer are: 1) Processing of input text or file 2) Extract tokens from the input string/file 3) Identify the clauses and predicates 4) Represent the text in the form of FOL. Figure2.Comparison Between Database Management Systemand Knowledge Management System. Figure 3. Phases involved in design of Knowledge Management System Figure 4. Functions of Knowledge Acquisition Phase Figure 5. Input text to the System in the.txt format DOI: 10.9790/0661-1803058993 www.iosrjournals.org 90 Page

We will explain these functionalities in detail in the following sub-sections. Refer Figure 4. 1. Processing of input text or file The input to the system is a text. We can either import a file or use a string of characters as an input. This text may be a paragraph or a mere sentence. The format of the text taken is.txt. The text of.docx format can also be given to the system. Refer Figure 5. 2. Extract tokens from the input string/file The imported file is read and stored it in buffer to tokenize the clauses. Clause is nothing but a collection of literals [3]. The tokens of words are created in Java using built-in class StringTokenizer. Token is a single atomic element in a string. We are using space as the condition to make tokens out of a string. 3. Identify the Functional and Predicate symbols The next step is to classify various function symbols, predicate symbols and connectives. All the Connectives are predefined in the system so that they can be sorted easily. So our main aim in this step is recognize Functional symbols and Predicate symbols. In the above example, functional symbols are Name, Yugandhara Nimbalkar, Vellore Institute Technology, RF, Dr.Justus, My friend Sayali, Dr.Parvathy, Dean, School of Computing Science, School of Law. Predicate symbols are studyingin, doing, under, from, of, is. It is hereby proposed the idea for representing the high level text in FOL:We will use the Natural Language Processing concepts are used for linguistic and semantic knowledge from the text for learning. 1. Using the Natural Language Processing Parser, divide the sentence into Subject Verb Object 2. Exclude all the stop-words like the, a and an. 3. Make the separate clauses of subject, verb and object. 4. Verb present will form the Predicate Symbols while the Subject and the Object will form the Function Symbols. Is is an important verb in English language. Sometimes it acts as a supporting verb and sometimes it acts as a main verb. So based on this verb, this algorithm is developed which can create clauses and distinguish whether it is Functional symbol or Predicate symbol The Proposed Algorithm is: DOI: 10.9790/0661-1803058993 www.iosrjournals.org 91 Page

5. Represent the text in the form of FOL The higher level text or query that is processed in the first step is converted to the First-Order Logic (FOL). This is necessary in the design layer so that the concepts extracted are validated for correct and concrete representation. The functional symbols are represented as capital letters (P, Q etc.) and the Predicate symbols are represented as capital letters followed by parenthesis. Example X(A,B) or Y(P,Q). In addition to these the set operators (Union, Intersection), relational operators (<, >, =), and logical operations (subsumes, presumes, entails etc.). The given text needs to be converted as the FOL grammar for deriving logical entailments of the concepts and their relations. B. Knowledge Representation Using various rules and logics, relations are developed between these symbols. Here, in this layer, the relations between this symbols can be represented using various methods. 1. First Order Logic 2. Frames 3. Description Logic 1) First Order Logic In First Order Logic, quantified variables are used. Instead of propositions, variables are used in this type of representation. In FOL, facts and rules are made up of Predicate Symbols and Functional Symbols.The above text can be represented in FOL as MyName(Yugandhara) studyin (I, Vellore Institute of Technology) myrf (Dr.Justus) myschool (School of Computing Science and Engineering) deanof (Dr. Jegananthan, School of Computing Science and Engineering) and so on. Frame is another way of representing knowledge.there are two types of frames- Individual Frame- to represent single object. Generic Frame-to represent categories or classes of objects. Above text can be represented in the form of Frames as follows: (School <:Name SchoolName> <:Dean Person> <: Location Address> <: NoOfFaculties (IF NEEDED {let x<-self:1} (Student <: IS-A Person> <: RegistrationNo Number> <: Year year> (Yugandhara <: INSTANCE-OF Student> <: PhoneNo Number> <: Hobbies Reading> (Person <: myname name> <: Age Number> <: BirthDate Date> <: City Location> IF-ADDED :myname(name) DOI: 10.9790/0661-1803058993 www.iosrjournals.org 92 Page

3) Description Logic (DL) Description Logic is used in Knowledge representation of important concepts from application domain. The important terms used in this type of representation are concepts, role and individuals, and their relationships. Above text can be represented using DL as follows: (School [EXISTS20: Students] [EXISTS1 Dean] [EXISTS1 Course] [ALL Faculty Course] [ALLResearchFacilitator Faculty] (Student = [EXISTS 1 RegistrationID] [FILLS Pass Criteria] [EXISTS 27 Credits] (Person= [EXISTS 1 Name] [EXISTS 1 Address] [FILLS Finite Age] C. Knowledge Storing The symbols in the Conceptual graphs is then stored in the Storage layer in the form of Object Relational Database System. D. Knowledge Sharing& Reuse The Knowledge stored in Storage layer of one KMS can be shared with any other KMS. Knowledge Units are modeled to concepts and objects in Object-relational database. This will enable Object-based storage (OBS) of KUs.When some new facts are added to the system, the existing knowledge is updated or modified accordingly. Knowledge Reuse is related to the reusability of the concepts from the existing KMS. IV. Conclusion Thus we have extracted the clauses from the text. These clauses are domain dependent. Then the clauses are identified as the Functional symbols and Predicate symbols using the YIS algorithm. The clauses are then represented using FOL form and then stored in the database or knowledgebase. If Is is supporting verb in the sentence, then clauses will form the Functional symbol and if is is main verb in the sentence then clauses will form the Predicate symbols. References [1]. 1.Ronak Kharadkar and Justus S, Analytical Validation of 3 layer knowledgebase design, Conference on Science Engineering and Technology, VIT University,2014. [2]. RonakKharadkar and Justus S, Designing Knowledge Representation Framework for ICD-10, 1st International conference on futuristic trend in computational analysis and knowledge management (ABLAZE 2015),2015 [3]. Ronald J. Brachman and Hector Levesque, Knowledge Representation and Reasoning,1st Edition May,2004 [4]. Wei-Tek, Rama Vishnuvajjala and Du ZhangYan, Verification and Validation of Knowledge Based Systems, IEEE Transactions on Knowledge and Data Engineering, vol. 11, no.1, January 1999 [5]. Amar Arbouh, Mohamed Menacer and Yasser M. Alginahi, Design Concepts of a KnowledgeBase System for Research and Studies in Quran and Its Science,2013 Taibah University International Conference, December 2013 DOI: 10.9790/0661-1803058993 www.iosrjournals.org 93 Page