By: Seema S Shalini H S Shashi Kumar Shilpa K Shirin Kathriki

Introduction
In todays global economy, capital moves speedily, technology spreads quickly and goods can be made in low cost countries and shipped to developed markets
Managing knowledge in such a phase of continuous change is an imperative function for smart organizations.

 Knowledge Management for the future organizations has

many implications and impacts on the way our existing educational, sociocultural, economical, religious, governmental processes work. Many connectivity, document management, concepts management, project management, employees portals and so called knowledge management tools and techniques are available. Ontology is another wonderful technique which is probably the ultimate choice for managing knowledge in virtually all possible environments.

Knowledge Engineering

 Knowledge engineering (KE) was defined in 1983 by Edward

Feigenbaum, and Pamela McCorduck.

KE is an engineering discipline that involves

integrating knowledge into computer systems in order to solve complex problems normally requiring a high level of human expertise.
Knowledge engineering is also related to mathematical logic.

 It is strongly involved in cognitive science and socio-

cognitive engineering where the knowledge is produced by socio-cognitive aggregates (mainly humans) and is structured according to our understanding of how human reasoning and logic works. It has a great deal in common with software engineering. It is used in many computer science domains such as artificial intelligence, including databases, data mining, expert systems, decision support systems and geographic information systems.

Various activities of KE specific for the development of a knowledge- based system: Assessment of the problem Development of a knowledge-based system shell/structure Acquisition and structuring of the related information, knowledge and specific preferences (IPK model) Implementation of the structured knowledge into knowledge bases Testing and validation of the inserted knowledge Integration and maintenance of the system Revision and evaluation of the system.

 KE is more of an art than engineering.

KE is not as neat as the above list in practice. The phases overlap, the process might be iterative, and many

challenges could appear. Meta- knowledge engineering new formal systematic approach for development of a unified knowledge and intelligence theory.

Knowledge Engineering Principles

Knowledge engineers acknowledge that there are different:
types of knowledge each requiring its own approach and technique. types of experts and expertise, such that methods should be chosen

appropriately. ways of representing knowledge, which can aid the acquisition, validation and re-use of knowledge. ways of using knowledge, so that the acquisition process can be guided by the project aims (goal-oriented).

KE use structured methods increase the efficiency of the

acquisition process. Knowledge Engineering is the process of eliciting Knowledge for any purpose be it Expert system or AI development.

Views of Knowledge Engineering

Transfer View
the traditional view the assumption is to apply conventional knowledge engineering

techniques to transfer human knowledge into artificial intelligence systems.

Modeling View
the alternative view. the knowledge engineer attempts to model the knowledge and

problem solving techniques of the domain expert into the artificial intelligence system.

Knowledge and Models

Knowledge is more than a static encoding of facts. It includes ability to use those facts in interacting with world.

Basic Premise of AI:

Form a mental model that accurately represents the thing as

well as the actions that can be performed by it and on it. To test possible actions, AI systems construct microworlds.

 ISSUES: Psychology Linguistic Philosophy Computer Science

Theory of Computation

Introduction
The theory of computation is the branch of computer
science and mathematics that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm Two types

1.Computability theory
2.Complexity theory

Turning machine
A PC with infinite memory capacity. Small discreet chunks of memory.

Computation style is reasonable model.

Computability theory
It deals with ,to what extent a given problem can actually

be solved. Closely related to recursion theory

Complexity theory
It not only deals with whether a problem can be solved at all on the computer, but also how efficiently the problem can be solved
Two major components are

1.Time complexity 2.Space complexity

INTRODUCTION
John McCarthy, who coined the term in 1955 defines it as The science and engineering of

making intelligent machines".

Major AI researchers and textbooks define the field as

The study and design of intelligent agents"

EVOLUTION
BCs - Ancient myths (Greek and Egypt)
1956 - Conference at Dartmouth College (John Mcarthy,

Marvin Minsky and Allen Newell) 1960s US Navy dept proposal 1980s - AI concepts development using IT Early 2000 Data mining and medical diagnosis

* 1997 Computer Aided with AI competes with and beats

then world champion (CHESS) Garry Kasparov

WHY DO WE NEED?
Advancement in Medical technology
Areas where Human existence is difficult e.g Outer space

and harsh climatic conditions

To solve complex problems without human interface

Faster solutions to save time

Next path to the future

FEATURES
1. Learn from experience and apply the knowledge

2. Handle complex situations

3. Solve problems with important information is 4. 5. 6. 7.

8.

missing Determine what is imp React correctly and quickly Understand Visual Images Creativity Heuristics

ADVANTAGES AND DISADVANTAGES

BOON BANE

1.Improvements in Medicine Sciences

2. Ease of work at Mines etc where the climatic conditions are harsh 3. Faster reaction time 4. Consistent outputs 5. Effeciency is high 6. Reduces Man power 7. Can be integrated easily

1. High cost
2. Over dependence of machines 3. Reduces human potential 4. Domain specific 5. Rise of the machines

NEXT IS WHAT?
1. Sky net 2. Text analysis 3. Advanced robotics 4. Planning systems

5. Expert systems
6. Automation and control

Data Structures and Algorithms

What is Data Structures?

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks.

Data structures provide a means to manage large amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory.

Types of Data Structure

Primitive Types: These are the primary level of data

structures, used to store basic data.

Boolean (for boolean values True/False) Char (for character values) Float (for storing real number values) Double (a larger size of type float)

 Composite Types: These are the secondary level of

data structures, used to store higher and more complex data when compared to primitive types.
Array Record (also called tuple or struct) Union

 Abstract Types: These are the data provides operating

and minimize dependency on the code.

Container Map/Associative array/Dictionary

Multimap
List Set Multiset Priority queue Queue

The programming languages such as C, C++, JAVA, DOT NET come equipped with a set of built in types, such as integers and floating points numbers, that allow us to work with data which the machines processor has native support. Built- in types also hide details both about their execution and limitations.

Example
Consider computing the length of a hypotenuse:
Let c:= sqrt(a*a+b*b) The processors allow the programmers to think about what value was computed instead of how it was computed.

Two useful and related concepts

Abstraction: is when common patterns are grouped

together under a single name and then processed, in order to achieve a higher level understanding of that pattern. Encapsulation: is a mechanism to hide the implementation details of an abstraction away from the users of abstraction.

Algorithm An algorithm is an effective method for solving a

problem using a finite sequence of instructions in a step-by-step process. Algorithm are used for calculation, data processing and many other fields. Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well- defined series of successive states, eventually terminating in a final ending state.