Professional Documents
Culture Documents
AI Handbk
AI Handbk
DEFINITION
Thinking Humanly
“The exciting new effort to make computers think ...machines with minds, in
the full and literal sense.” (Haugeland, 1985)
Thinking Rationally
“The study of the computations that make it possible to perceive, reason, and
act.” (Winston, 1992)
Acting Humanly
“The art of creating machines that perform functions that require intelligence
when performed by people.” (Kurzweil, 1990)
Acting Rationally
(Note: By rationality, we mean a system that does the “right thing,” given
what it knows).
Acting humanly: The Turing Test approach
The Turing Test, proposed by Alan Turing (1950), was designed to provide a
operational definition of intelligence. A computer passes the test if a human
interrogator, after posing some written questions, cannot tell whether the
written responses come from a person or from a computer. programming a
computer to pass a rigorously applied test provides plenty to work on. The
computer would need to possess the following capabilities:
If we are going to say that a given program thinks like a human, we must have
some way of determining how humans think. We need to get inside the actual
workings of human minds. There are three ways to do this: through
introspection—trying to catch our own thoughts as they go by; through
psychological experiments—observing a person in action; and through brain
imaging—observing the brain in action. Once we have a sufficiently precise
theory of the mind, it becomes possible to express the theory as a computer
program. If the program’s input–output behavior matches corresponding
human behavior, that is evidence that some of the program’s mechanisms
could also be operating in humans.
Thinking rationally: The “laws of thought” approach
The Greek philosopher Aristotle was one of the first to attempt to codify “right
thinking,” that is, irrefutable reasoning processes. His syllogisms provided
patterns for argument structures that always yielded correct conclusions when
given correct premises—for example, “Socrates is a man; all men are mortal;
therefore, Socrates is mortal.” These laws of thought were supposed to govern
the operation of the mind; their study initiated the field called logic.
There are two main obstacles to this approach. First, it is not easy to take
informal knowledge and state it in the formal terms required by logical
notation, particularly when the knowledge is less than 100% certain. Second,
there is a big difference between solving a problem “in principle” and solving it
in practice. Even problems with just a few hundred facts can exhaust the
computational resources of any computer unless it has some guidance as to
which reasoning steps to try first.
An agent is just something that acts (agent comes from the Latin agere, to do).
Of course, all computer programs do something, but computer agents are
expected to do more: operate autonomously, perceive their environment,
persist over a prolonged time period, adapt to change, and create and pursue
goals. A rational agent is one that acts so as to achieve the best outcome or,
when there is uncertainty, the best expected outcome. In the “laws of
thought” approach to AI, the emphasis was on correct inferences. Making
correct inferences is sometimes part of being a rational agent, because one
way to act rationally is to reason logically to the conclusion that a given action
will achieve one’s goals and then to act on that conclusion. On the other hand,
correct inference is not all of rationality; in some situations, there is no
provably correct thing to do, but something must still be done.
The rational-agent approach has two advantages over the other approaches.
First, it is more general than the “laws of thought” approach because correct
inference is just one of several possible mechanisms for achieving rationality.
Second, it is more amenable to scientific development than are approaches
based on human behavior or human thought. The standard of rationality is
mathematically well defined and completely general, and can be “unpacked”
to generate agent designs that provably achieve it.
SUMMARY
What is AI Technique? In the real world, the knowledge has some unwelcomed
properties:
Chapter two
Philosophy
Aristotle (384–322 B.C.), was the first to formulate a precise set of laws
governing the rational part of the mind. He developed an informal system of
syllogisms for proper reasoning, which in principle allowed one to generate
conclusions mechanically, given initial premises. Much later, Ramon Lull (d.
1315) had the idea that useful reasoning could actually be carried out by a
mechanical artifact. Thomas Hobbes (1588–1679) proposed that reasoning was
like numerical computation, that “we add and subtract in our silent thoughts.”
The automation of computation itself was already well under way.
Mathematics
• How should we do this when the payoff may be far in the future? The science
of economics got its start in 1776, when Scottish philosopher Adam Smith
(1723–1790) published An Inquiry into the Nature and Causes of the Wealth of
Nations. While the ancient Greeks and others had made contributions to
economic thought, Smith was the first to treat it as a science, using the idea
that economies can be thought of as consisting of individual agents maximizing
their own economic well-being. Most people think of economics as being
about money, but economists will say that they are really studying how people
make choices that lead to preferred outcomes.
Neuroscience
Computer engineering
AI owes a debt to the software side of computer science, which has supplied
the operating systems, programming languages, and tools needed to write
modern programs (and papers about them).
Control theory and cybernetics
Ktesibios of Alexandria (c. 250 B.C.) built the first self-controlling machine: a
water clock with a regulator that maintained a constant flow rate. This
invention changed the definition of what an artifact could do. Previously, only
living things could modify their behavior in response to changes in the
environment. Other examples of self-regulating feedback control systems
include the steam engine governor, created by James Watt (1736–1819), and
the thermostat, invented by Cornelis Drebbel (1572–1633), who also invented
the submarine. The mathematical theory of stable feedback systems was
developed in the 19th century.
Linguistics
Modern linguistics and AI, then, were “born” at about the same time, and grew
up together, intersecting in a hybrid field called computational linguistics or
natural language processing. The problem of understanding language soon
turned out to be considerably more complex than it seemed in 1957.
Understanding language requires an understanding of the subject matter and
context, not just an understanding of the structure of sentences. This might
seem obvious, but it was not widely appreciated until the 1960s. Much of the
early work in knowledge representation (the study of how to put knowledge
into a form that a computer can reason with) was tied to language and
informed by research in linguistics, which was connected in turn to decades of
work on the philosophical analysis of language.
HISTORY OF A.I
1923
Karel Čapek’s play named “Rossum's Universal Robots” (RUR) opens in London,
first use of the word "robot" in English. 1943 Foundations for neural networks
laid. 1945 Isaac Asimov, a Columbia University alumni, coined the term
Robotics.
1950
Alan Turing introduced Turing Test for evaluation of intelligence and published
Computing Machinery and Intelligence. Claude Shannon published Detailed
Analysis of Chess Playing as a search.
1956
1964
1965
1973
The Assembly Robotics group at Edinburgh University built Freddy, the Famous
Scottish Robot, capable of using vision to locate and assemble models.
1985
1990
The Deep Blue Chess Program beats the then world chess champion, Garry
Kasparov.
2000
APPLICATIONS OF AI
Gaming AI plays crucial role in strategic games such as chess, poker, tic-tac-
toe, etc., where machine can think of large number of possible positions based
on heuristic knowledge.
CHAPTER THREE
INTELLIGENT SYSTEMS
What is Intelligence?
Types of Intelligence
Linguistic intelligence
Musical intelligence
Spatial intelligence
The ability to perceive visual or spatial information, change it, and re-create
visual images without reference to the objects, construct 3D images, and to
move and rotate them. Example Map readers, Astronauts, Physicists
Bodily-Kinesthetic intelligence
The ability to use complete or part of the body to solve problems or fashion
products, control over fine and coarse motor skills, and manipulate the
objects. Example Players, Dancers
Intra-personal intelligence
Interpersonal intelligence
The ability to recognize and make distinctions among other people’s feelings,
beliefs, and intentions. Example Mass Communicators, Interviewers.
What is Intelligence Composed of?
Inductive Reasoning
Even if all of the premises are true in a statement, inductive reasoning allows
for the conclusion to be false.
Deductive Reasoning
If something is true of a class of things in general, it is also true for all members
of that class.
3. Problem solving: It is the process in which one perceives and tries to arrive
at a desired solution from a present situation by taking some path, which is
blocked by known or unknown hurdles.
CHAPTER THREE
RATIONAL AGENT
What are Agent and Environment? An agent is anything that can perceive its
environment through sensors and acts upon that environment through
effectors.
A human agent has sensory organs such as eyes, ears, nose, tongue and skin
parallel to the sensors, and other organs such as hands, legs, mouth, for
effectors.
A robotic agent replaces cameras and infrared range finders for the sensors,
and various motors and actuators for effectors.
A software agent has encoded bit strings as its programs and actions.
Agents Terminology
Behavior of Agent: It is the action that agent performs after any given
sequence of percepts.
Percept Sequence: It is the history of all that an agent has perceived till date.
They choose actions only based on the current percept. They are rational
only if a correct decision is made only on the basis of current precept. Their
environment is completely observable.
They use a model of the world to choose their actions. They maintain an
internal state.
How the world evolves. How the agent’s actions affect the world.
Goal-Based Agents
Utility-Based Agents
Goals have some uncertainty of being achieved and one needs to weigh
likelihood of success against the importance of a goal.
The Nature of Environments
Turing Test
Two persons and a machine to be evaluated participate in the test. Out of the
two persons, one plays the role of the tester. Each of them sits in different
rooms. The tester is unaware of who is machine and who is a human. He
interrogates the questions by typing and sending them to both intelligences, to
which he receives typed responses. This test aims at fooling the tester. If the
tester fails to determine machine’s response from the human response, then
the machine is said to be intelligent.
Single agent / Multiple agents: The environment may contain other agents
which may be of the same or different kind as that of the agent.
Accessible vs. inaccessible: If the agent’s sensory apparatus can have access
to the complete state of the environment, then the environment is accessible
to that agent.
Artificial Intelligence
Speech Recognition
Voice Recognition
The user input spoken at a microphone goes to sound card of the system. The
converter turns the analog signal into equivalent digital signal for the speech
processing. The database is used to compare the patterns to recognize the
words. Finally, a reverse feedback is given to the database.
Neural Networks
Searching is the universal technique of problem solving in AI. There are some
single-player games such as tile games, Sudoku, crossword, etc. The search
algorithms help you to search for a particular position in such games.
Search Terminology
Problem Space: It is the environment in which the search takes place. (A set of
states and set of operators to change those states)
Problem Space Graph: It represents problem state. States are shown by nodes
and operators are shown by edges.
Space Complexity: The maximum number of nodes that are stored in memory.
Branching Factor: The average number of child nodes in the problem space
graph.
Depth: Length of the shortest path from initial state to goal state.
Requirements –
State description
A set of valid operators
Initial state
Goal state description
Breadth-First Search
It starts from the root node, explores the neighboring nodes first and moves
towards the next level neighbors. It generates one tree at a time until the
solution is found. It can be implemented using FIFO queue data structure. This
method provides shortest path to the solution.
If branching factor (average number of child nodes for a given node) = b and
depth = d, then number of nodes at level d = bd.
Disadvantage: Since each level of nodes is saved for creating next one, it
consumes a lot of memory space. Space requirement to store nodes is
exponential.
Its complexity depends on the number of nodes. It can check duplicate nodes.
Depth-First Search
As the nodes on the single path are stored in each iteration from root to leaf
node, the space requirement to store nodes is linear. With branching factor b
and depth as m, the storage space is bm.
The path from initial state is concatenated with the inverse path from the goal
state. Each search is done only up to half of the total path.
Uniform Cost Search Sorting is done in increasing cost of the path to a node. It
always expands the least cost node. It is identical to Breadth First search if
each transition has the same cost.
Disadvantage: There can be multiple long paths with the cost ≤ C*. Uniform
Cost search must explore them all.