UNIT – 1

Introduction to Artificial
Intelligence

Graphic Era Hill University

GEHU Jan -Jun 23 1

 Introduction to Artificial Intelligence
• Definition: "It is a branch of computer science by which we
can create intelligent machines which can behave like a
human, think like humans, and able to make decisions.“
• Artificial Intelligence is composed of two words Artificial and
Intelligence, where Artificial defines "man-made," and
intelligence defines "thinking power", hence AI means "a
man-made thinking power."

GEHU Jan -Jun 23 2

 Simulation of sophisticated & Intelligent Behavior
indifferent area under Artificial Intelligence
• Sophisticated Simulation & Intelligent Behavior are two areas
in computer science that are being used to Complex Model
Systems under Artificial Intelligence.
• Artificial intelligence programming methods permit more
realistic and robust simulation models and help the user to
develop, run, and interpret simulation experiments.
• Intelligent behavior is the capability of using one's
knowledge about the world to make decisions in novel
situations.

GEHU Jan -Jun 23 3

 Simulation of sophisticated & Intelligent Behavior
indifferent area under Artificial Intelligence

GEHU Jan -Jun 23 4

 Problem Solving in Games under Artificial
Intelligence

• Heuristics Approach

• Searching Algorithms

• Computing Evolutionary

• Genetic Algorithms

GEHU Jan -Jun 23 5

 Heuristics Approach

GEHU Jan -Jun 23 6

 Searching Algorithms
• In Artificial Intelligence, Search techniques are universal
problem-solving methods.
• AI mostly used search strategies or algorithms to solve a
specific problem and provide the best result.
• We can classify the search algorithms into uninformed search
and informed search algorithms.

GEHU Jan -Jun 23 7

 Uninformed/Blind Search:
• The uninformed search does not contain any domain
knowledge such as closeness, the location of the goal. It
operates in a brute-force way as it only includes information
about how to traverse the tree and how to identify leaf and
goal nodes. Uninformed search applies a way in which search
tree is searched without any information about the search
space like initial state operators and test for the goal, so it is
also called blind search. It examines each node of the tree until
it achieves the goal node.

GEHU Jan -Jun 23 8

 Informed Search:
• Informed search algorithms use domain knowledge. In an
informed search, problem information is available which can
guide the search. Informed search strategies can find a solution
more efficiently than an uninformed search strategy. Informed
search is also called a Heuristic search.
• A heuristic is a way which might not always be guaranteed for
best solutions but guaranteed to find a good solution in
reasonable time.
• Informed search can solve much complex problem which
could not be solved in another way.

GEHU Jan -Jun 23 9

 Computing Evolutionary
• Evolutionary computation is a sub-field of artificial
intelligence (AI) and is used extensively in complex
optimization problems and for continuous optimization.
• Evolutionary computation is used to solve problems that have
too many variables for traditional algorithms.

GEHU Jan -Jun 23 10

 Computing Evolutionary
The following gif shows several generations of dinosaurs learning to walk
by optimizing their body structure and applied muscular forces. From left to
right the generation increases, so the further right, the more optimized the
walking process is. Despite the fact that the early generation dinosaurs were
unable to walk, the EA was able to evolve the dinosaurs over time through
mutation and crossover into a form that was able to walk.

GEHU Jan -Jun 23 11

 Genetic Algorithms under CE
• A genetic algorithm is a search-based algorithm used for
solving optimization problems in AI. This algorithm is
important because it solves difficult problems that would take
a long time to solve. It has been used in various real-life
applications such as data centers, electronic circuit design,
code-breaking, image processing, and artificial creativity.

GEHU Jan -Jun 23 12

 Genetic Algorithms under CE
Application areas
•Transport: Genetic algorithms are used in the traveling salesman problem to
develop transport plans that reduce the cost of travel and the time taken. They
are also used to develop an efficient way of delivering products.
•DNA Analysis: They are used in DNA analysis to establish the DNA
structure using spectrometric information.
•Multimodal Optimization: They are used to provide multiple optimum
solutions in multimodal optimization problems.
•Aircraft Design: They are used to develop parametric aircraft designs. The
parameters of the aircraft are modified and upgraded to provide better designs.
•Economics: They are used in economics to describe various models such as
the game theory, cobweb model, asset pricing, and schedule optimization.

GEHU Jan -Jun 23 13

 Natural Language in Artificial Intelligence
• Natural language processing (NLP) is a branch of artificial
intelligence within computer science that focuses on
helping computers to understand the way that humans
write and speak.

GEHU Jan -Jun 23 14

 Natural Language in Artificial Intelligence
• Lexical Analysis − It involves identifying and analyzing the structure of words.
• Syntactic Analysis − It involves analysis of words in the sentence for grammar and
arranging words in a manner that shows the relationship among the words.
• Semantic Analysis − It draws the exact meaning or the dictionary meaning from
the text.
• Discourse Integration − The meaning of any sentence depends upon the meaning
of the sentence just before it. In addition, it also brings about the meaning of
immediately succeeding sentence. It means a sense of the context.
• Pragmatic Analysis − During this, what was said is re-interpreted on what it
actually meant. It involves deriving those aspects of language which require real
world knowledge. It deals with outside word knowledge, which means
understanding i.e external to documents and queries.

GEHU Jan -Jun 23 15

Automated Reasoning Visual Perception in
Artificial Intelligence

• Automated reasoning computers can be used to automate and

apply logical reasoning to tasks like proving theorems,

verifying proofs, and designing circuits.

• Automated reasoning is the area of computer science that is

concerned with applying reasoning in the form of logic to

computing systems.

GEHU Jan -Jun 23 16

 Heuristic Algorithm Versus Solution Guaranteed
Algorithms
• Solution Guaranteed Algorithms provide step-by-step
procedures that can guarantee solutions, but heuristics
are faster and provide shortcuts for getting to solutions,
though this has the potential to cause errors.

GEHU Jan -Jun 23 17

 THANK YOU

GEHU Jan -Jun 23 18