Professional Documents
Culture Documents
UNIT 1
What is AI?
The study of how to make computers do things at which at the moment, people are better.
Systems that think like humans
Systems that act like humans
Systems that think rationally
Systems that act rationally
Credit granting
– Information management and retrieval
– AI and expert systems embedded in products
– Plant layout
– Hospitals and medical facilities
List the types of task environments.
A hill-climbing algorithm is an Artificial Intelligence (AI) algorithm that increases in value continuously until it
achieves a peak solution. This algorithm is used to optimize mathematical problems and in other real-life
applications like marketing and job scheduling.
What are the different kinds of agent programs?
Simple reflex agents
Model-based reflex agents
Goal-based agents
Utility-based agents
Define an agent.
An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that
environment through actuators
What is Heuristic Search?
A heuristic search is a technique that improves the efficiency of a search process, possibly by sacrificing claims
of completeness
What is A* Algorithms
A* Search is the most widely used form of best-first search. The evaluation function f(n) is
obtained by combining
(1) g(n) = the cost to reach the node,and
(2) h(n) = the cost to get from the node to the goal :
f(n) = g(n) + h(n).
What is game playing?
The term Game means a sort of conflict in which n individuals or groups (known as players) participate. Game
theory denotes games of strategy.
Game theory allows decision-makers (players) to cope with other decision-makers (players) who have
different purposes in mind. In other words, players determine their own strategies in terms of the strategies
and goals of their opponent.
Give examples of real world problems
i. Airline travel problem. ii. Touring problem. iii. Traveling salesman problem.
Vacuum world problem. 8 – Queen problem 8 – Puzzle problem
Define search and search algorithm.
The process of looking for sequences actions from the current state to reach the goal
state is called search.
The search algorithm takes a problem as input and returns a solution in the form of action
sequence. Once a solution is found,the execution phase consists of carrying out the recommended
action..
UNIT 2
Simple sentences which are true or false are basic propositions. Larger and more complex sentences are
constructed from basic propositions by combining them with connectives. Thus propositions and connectives
are the basic elements of propositional logic. Though there are many connectives, we are going to use the
following five basic connectiveshere:NOT, AND, OR, IF_THEN(orIMPLY), IF_AND_ONLY_IF. They are
also denoted by the symbols: , , , , , respectively.
There is need to express properties of entire collections of objects,instead of enumerating the objects by name.
Quantifiers let us do this.
FOL contains two standard quantifiers called
a) Universal () and
b) Existential ()
Representational adequacy
. Inferential adequacy
. Inferential efficiency
. Acquisitional efficiency
What is predicate calculus?
Predicate Calculus is a generalization of propositional calculus.Hence besides terms, predicates, and quantifiers,
predicate calculus contains propositional variables, constants and connectives as part of the language.
Property inheritance, in which, elements of specific classes inherit attributes and values from more general
classes in which they are included