K.

RAMAKRISHNAN COLLEGE OF ENGINEERING

(AUTONOMOUS)
Samayapuram, Tiruchirappalli-621 112

CGB1222- ARTIFICIAL INTELLIGENCE AND MACHINE

LEARNING
MODULE-I
PART A
1. Define Artificial Intelligence (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 think rationally
• Systems that act rationally. Systems that act like humans

2. Differentiate between Intelligence and Artificial Intelligence.

INTELLIGENCE ARTIFICIAL INTELLIGENCE
It is a natural process. It is programmed by humans.
It is actually hereditary. It is not hereditary.
Knowledge is required for intelligence. KB and electricity are required to generate output.
No human is an expert. We may get better Expert systems are made which aggregate many
solutions from other humans. person’s experience and ideas.
3. Is AI a science, or is it engineering? Or neither or both? Explain.
Artificial Intelligence is most certainly a science. But it would be nothing with
engineering. Computer Scientists need somewhere to place their programs, such as computers,
servers, robots, cars, etc. But without engineers they would have no outlet to test their
Artificial Intelligence on. Science and Engineering go hand in hand, they both benefit each
other. While the engineers build the machines, the scientists are writing code for their AI.
4. Explain why problem formulation must follow goal formulation.
The goal formulation is used to steer the agent in the right direction, thus ignoring any
redundant actions. Problem formulation must follow this because it is based on the Goal
Formulation. It is the process of deciding what actions and states to consider given a certain
goal. A goal may be set in stone, but how you achieve it can vary. Usually the most optimal
way is chosen though.
5. Define Artificial Intelligence in terms of rational acting.
A field of study that seeks to explain and emulate intelligent behaviors in terms of
computational processes-Schalkoff. The branch of computer science that is concerned with
the automation of intelligent behavior-Luger & Stubblefield.

6. Define Artificial in terms of rational thinking.

The study of mental faculties through the use of computational models-Charniak &
McDermott. The study of the computations that make it possible to perceive, reason and act-
Winston.

7. What is meant by Turing test?

A Turing Test is a method of inquiry in artificial intelligence (AI) for determining
whether or not a computer is capable of thinking like a human being. The test is named after
Alan Turing.
To conduct this test we need two people and one machine. One person will be an
interrogator (i.e.) questioner, will be asking questions to one person and one machine. Three
of them will be in a separate room. Interrogator knows them just as A and B. so it has to
identify which is the person and machine. The goal of the machine is to make Interrogator
believe that it is the person’s answer. If machine succeeds by fooling Interrogator, the
machine acts like a human. Programming a computer to pass Turing test is very difficult.
8. What are the capabilities, computer should possess to pass Turing test?
Natural Language Processing -to enable it to communicate successfully in English
Knowledge Representation - to store what it knows or hears
Automated Reasoning - use the stored information to answer questions & to draw new conclusions
Machine Learning - to adapt to new circumstances and to detect and extrapolate patterns.

9. What is meant by Total Turing Test ?

The test which includes a video signals so that the interrogator can test
the perceptual abilities of the machine is termed Total turing test.

10. What are the capabilities computers needs to pass total Turing test?
Computer vision - to perceive objects.
Robotics - to manipulate objects and move about.

11. Define an agent.

An agent is anything that can be viewed as perceiving its environment through
sensors and acting upon that environment through actuators.

12. What is an agent function? Differentiate an agent function and an agent

program.
An agent’s behavior is described by the agent function that maps any given
percept sequence to an action.
AGENT FUNCTION - An abstract mathematical description
AGENT PROGRAM - A concrete implementation, running on the agent Architecture.

13. Define an Omniscient agent.

An omniscient agent knows the actual outcome of its action and can act
accordingly; but omniscience is impossible in reality.

14. What are the factors that a rational agent should depend on at any given time?
1. The performance measure that defines degree of success.
2. Ever thing that the agent has perceived so far. We will call this
complete perceptual history the percept sequence.
3. When the agent knows about the environment.
4. The action that the agent can perform.

15. Give the structure of agent in an environment

Agent interacts with environment through sensors and actuators. An Agent is anything that
can be viewed as perceiving (i.e.) understanding its environment through sensors and
acting upon that environment through actuators.
 Object is a real- world entity, identifiably separate from its surroundings, has a well
defined set of attributes and a well-defined set of procedures or methods. Object means a
combination of data and logic that represents some real-world entity. (E.g.) Car is an object Color,
manufacturer, cost, owner etc are attributes. Drive it, lock it, tow it, carry passengers in it are all
methods.

16. Define Ideal Rational Agent.

For each possible percept sequence, an ideal rational agent should do whatever action is
expected to maximize its performance measure on the basis of the evidence provided by the
percept sequence & whatever built in knowledge that the agent has.

17. Why are condition-action rules important in the design of an agent?

Rules are used to represent relationships. Rule-based knowledge representation employs IF
condition (premise antecedent) THEN action statements. (goal consequent)
For example: IF the heating element glows AND the bread is always dark THEN the
toaster thermostat is broken
When the problem situation matches the IF part of a rule, the action specified by the THEN
part of the rule is performed.

18. List down the characteristics of intelligent

agent. Internal characteristics are
Learning/reasoning: an agent has the ability to learn from previous experience and
to successively adapt its own behavior to the environment.
Reactivity: an agent must be capable of reacting appropriately to influences or
information from its environment.
Autonomy: an agent must have both control over its actions and internal states. The
degree of the agent’s autonomy can be specified. There may need intervention from the
user only for important decisions.
Goal-oriented: an agent has well-defined goals and gradually influence its
environment and so achieve its own goals.
External characteristics are
communication: an agent often requires an interaction with its environment to fulfill
its tasks, such as human, other agents, and arbitrary information sources.
cooperation: cooperation of several agents permits faster and better solutions for
complex tasks that exceed the capabilities of a single agent.
mobility: an agent may navigate within electronic communication networks.
Character: like human, an agent may demonstrate an external behavior with many
human characters as possible.

19. What is the use of online search agents in unknown environment?

Online search agents operate by interleaving computation and action: first it takes an action,
and then it observes the environment and computes the next action. Online search is a good idea in
dynamic or semi dynamic domains and stochastic domains. Online search is a necessary idea for
an exploration problem, where the states and actions are unknown to the agent.

20. List the major components in problem formulation in AI.

The four components are
• Initial state.
• State Space
• Goal Test and
• Path Cost
21. Why problem formulation must follow goal formulation?
Well goal formulation is used to steer the agent in the right direction, thus ignoring any
redundant actions. Problem formulation must follow this because it is based off of Goal
Formulation. It is the process of deciding what actions and states to consider given a certain
goal. A goal may be set in stone, but how you achieve it can vary. Usually the most optimal way is
chosen though.

22. What is a task environment? How it is specified?

Task environments are essentially the "problems" to which rational agents are the
"solutions" . A Task environment is specified using PEAS (Performance, Environment,
Actuators, and Sensors) description
Performance measure – evaluates the behaviour of the agent in an environment.
Environment - Set of students testing Agency
Actuators - Display exercises suggestions, corrections.
Sensors - Keyboard entry

23. List the properties of task environments.

Fully observable vs. partially observable.
Deterministic vs. stochastic.
Episodic vs sequential
Static vs dynamic.
Discrete vs. continuous.
Single agent vs. multiagent.

24. What are the four different kinds of agent programs?

• Simple reflex agents
• Model-based reflex agents
• Goal-based agents and
• Utility-based agents
25. What are utility based agents?
Goals alone are not really enough to generate high-quality behavior in most environments.
For example, there are many action sequences that will get the taxi to its destination
(thereby achieving the goal) but some are quicker, safer, more reliable, or cheaper than
others. A utility function maps a state (or a sequence of states) onto a real number, which
describes the associated degree of happiness.

26. What are the three classes of problem?

Ignorable, in which solution steps can be ignored. Recoverable, in which solution
steps can be undone. Irrecoverable, in which solution steps cannot be undone.
27. How can the performance of an agent are improved?
Performance of any agent can be improved by learning. Learning is a process that improves
the knowledge of an Artificial intelligent program by making observations about its
environment.
28. What is prompt engineering?
Prompt engineering is the practice of developing and optimizing prompts to efficiently use
language models (LMs) for a variety of applications
29. Why learn prompt engineering?
 Important for research, discoveries, and advancement
 Helps to test and evaluate the limitations of LLMs
 Enables all kinds of innovative applications on top of LLMs
30. Write the elements of basic prompt.
A prompt is composed with the following components:
• Instructions- A clear directive specifying the task you want the model to perform.
For example, "Summarize the following article."
• Context- Relevant background information that helps the model understand the task better.
This could include details about the topic, audience, or purpose.
• Input data-The information, resources, or materials provided to complete the task.
• Output indicator-Ensures the output is usable, meets expectations, and aligns with the task
requirements.
31. Illustrate the Prompt Engineering Techniques

Many advanced prompting techniques have been designed to improve performance on complex
tasks
• Few-shot prompts
• Chain-of-thought (CoT) prompting
• Self-Consistency
• Knowledge Generation Prompting
• ReAct

PART B
1. How did you describe PEAS description for at least four agent types? ii) How did you
describe PEAS?
2. Describe in detail about i) Simple reflex agent. ii) Model based agent. iii) Utility based
agent. iv) Goal based agent
3.Compare and contrast human intelligence to artificial intelligence with numerous
examples and applications.
4. Explain the role of Artificial intelligence in the future.
5. Discuss about agents and Environments.
6. Analyze the Characteristic of intelligent Agents.
7. Compose and explain in detail about intelligent agents.
8. Examine the PEAS specification of the task environment of an agent.
9. Explain the structure of agents.
10. Discuss about the multi – agent systems with the help of an illustration.
11. Describe the role of communication for intelligent agents.
12. Show how problem solving agents solving contingency problems different from
the one solving exploratory problems
13. Discuss on different types of Agent Program (or) Explain the types of agent with neat diagram.
14.For each of the following agents, develop a PEAS description of the task environment:
a. Robot soccer player;
b.Internet book-shopping agent;
c.Autonomous Mars rover;
d. Mathematician’s theorem-proving assistant
15. Explain in detail about prompt engineering techniques.
16. Illustrate in detail about the elements of prompt engineering.
 MODULE -II
PART A
1. Define Problem Formulation.
Problem Formulation is the process of deciding what actions and states to consider,
given a goal. Eg. Assume that the agent consider actions at the level of driving from one
major town to another. Each state therefore corresponds to being a particular town.

2. What are the four components to define a problem? Define them.

A problem can be defined by five components:
a. Initial state: that the agent starts in.
b. Actions: description of the possible actions available to the agent
c. Transition model: a description of what each action does.
d. Goal test: determines whether a given state is a goal state.
d. Path cost: function that assigns numeric cost to each path.

3. What is heuristic function?

The heuristic function is a way to inform the search about the direction to a goal.It provides
an informed way to guess which neighbor of a node will lead to a goal.There is nothing
magical about a heuristic function.It must use only information that can be readily obtained
about a node.

4. What is the use of heuristic functions?

A heuristic is a function, h(n) defined on the nodes of a search tree, which serves as an
estimate of the cost of the cheapest path from that node to the goal node. Heuristics are used
by informed search algorithms such as Greedy best-first search and A*

5. How does one characterize the quality of a heuristic?

The performance of heuristic search algorithms depends on the quality of the heuristic
function. Good heuristic can sometimes be constructed by relaxing the problem definition,
by pre computing solution costs for sub problems in a pattern database, or by learning from
experience with the problem class.
6. Define a graph and a path.
The state space forms a directed network or graph in which nodes are states and the links
between the nodes are actions. A path in the state space is a sequence of states connected by
a sequence of actions.

7. What is a optimal solution?

A solution to a problem is an action sequence that leads from the initial state to the goal
state. A solution quality is measured by the path cost function and an optimal solution has
the lowest path cost among all solutions.

8. Indicate the role of Heuristics in guiding a search.

The path cost from the current state to goal state is calculated, to select the minimum path
cost as the next state.
9. Define abstraction
The process of removing detail from a representation is called abstraction. The
abstraction is valid if any abstract solution can be expanded into a solution in the more
detailed world. The abstraction is useful if carrying out each of the actions in the solution is
easier than the original problem. The choice of good abstraction thus involves removing as
much detail as possible while retaining validity and ensuring that the abstract actions are
easy to carry out.
10. Define the effect of heuristic accuracy on performance.
One way to characterize the quality of the heuristic is the effective branching factor b*.
if the total number of nodes generated by A* for a particular problem is N, and the solution
depth is d, then b* is the branching factor that a uniform tree of depth d would have to have in
order to contain N+1 nodes. Thus N+1=1+b*+(b*)2+ . . . + (b*)d.

11. What is the difference between uninformed and informed search strategies?
UNINFORMED SEARCH(BLIND INFORMED SEARCH(HEURISTIC
SEARCH) SEARCH)
No information about the number of steps The path cost from the current state to
(or) path cost from the current state to goal goal state is calculated, to select the
state minimum path cost as the next state
Less effective in search method More effective
Problem to be solved with the given Additional information can be added as
information assumption to solve the problem
E.g. a)Breadth first search
b)Uniform cost search
c) Depth first search E.g.
d)Depth limited search a) Best first search
e)Interactive deepening search b) Greedy search
f)Bi-directional search c) A* search
12. State the significance of using heuristic functions?
• The path cost from the current state to goal state is calculated, to select the minimum
path cost as the next state.
• Find the shortest solution using heuristic function that never over estimates the number
of steps to the goal.

13. List the criteria to measure the performance of search strategies.

The criteria to measure the performance of search strategies are:
a. Completeness: is the algorithm guaranteed to find a solution when there is one?
b. Optimality: does the strategy find the optimal solution?
c. Time complexity: how long does it take to find a solution?
d. Space complexity: how much memory is needed to perform the search?

14. How to improve the effectiveness of a search-based

problem- solving technique?
• Goal formulation
• Problem formulation
• Search
• Solution
• Execution phase
15. Will Breadth-First Search always finds the minimal solution. Why?
Yes, It starts from the root node, explores the neighboring nodes first and moves towards
the next level neighbors, This method provides shortest path to the solution.

16. What is a constraint satisfaction problem?

A Constraint Satisfaction problem (or CSP) is defined by a set of variables X1, X2,
…..,Xn, and a set of constraints, C1,C2,…..,Cm. Each variable Xi has a nonempty domain Di
of possible values. Each constraint Ci involves some subset of the variables and specifies
the allowable combinations of values for that subset. A state of the problem is defined by
an assignment of values to some or all of the variables,{Xi = vi,Xj=vj,…} A solution to a
CSP is a complete assignment that satisfies all the constraints.
17. What is the use of online search agents in unknown environment?
Online search agents operate by interleaving computation and action: first it takes an
action, and then it observes the environment and computes the next action. Online search
is a good idea in dynamic or semi dynamic domains and stochastic domains. Online
search is a necessary idea for an exploration problem, where the states and actions are
unknown to the agent.
18. Formally define Game as a kind of search problems.
Consider of a 3x3 board with eight numbered tiles and a blank space. A tile
adjacent to the blank space can slide into the space. The object is to reach a specified
goal state.
19. List some of the uninformed search techniques.
Uninformed Search Techniques:
➢
Depth-first Search
➢
Breadth-first Search
➢
Iterative Deepening
20. What are optimization problems?
In optimization problems, the aim is to find the best state according to an objective
function the optimization problem is then: Find values of the variables that minimize or
maximize the objective function while satisfying the constraints.

21. What’s the difference between a world state, a state description, and a
search node? Why is this distinction useful?
A world state is what the world looks like, while a state description tells us about the
state in every detail, and a search node is a data representation of the search. So the world
state is the state itself, the state description is information on it, and the search node is the
search data.

22. Define Monotonicity

Monotonicity (consistency): In search tree any path from the root, the f-cost never
decreases. This condition is true for almost all admissible heuristics. A heuristic which
satisfies this property is called monotonicity.

23. What is a ridge?

Ridges are a challenging problem for hill climbers that optimize in continuous
spaces.Because hill climbers only adjust one element in the vector at a time,each step
will move in an axis-aligned direction.

24. What are the advantages of Breadth First Search?

BFS will not get trapped exploring a blind alley. This contrast to the DFS which may
follow a single unfruitful path for a very long time, perhaps forever before the path
actually terminates in a state that has no successors.If there is a solution, then BFS is
guaranteed to find it. Furthermore, if there are multiple solutions then a minimal solution
will be found.

25. What is the difference between Simple Hill Generate and Test algorithm Climbing
The key difference between Simple Hill Climbing and Generate and Test algorithm is the
use of an evaluation function as a way to inject task-specific knowledge into the control
process.
 26. What is A* search?
A * search is the most widely-known form of best-first search. It evaluates the nodes by
combining g(n),the cost to reach the node, and h(n),the cost to get from the node to the
goal:
f (n) = g(n) + h(n)

Where f (n) = estimated cost of the cheapest solution through n. g (n) is the path cost from
the start node to node n.
h (n) = heuristic function
A * search is both complete and optimal.

29. How much knowledge would be required by a perfect program for the problem of
playing chess? Assume that unlimited computing power is available.
The rules for determining legal moves and some simple control mechanism that
implements an appropriate search procedure. Additional knowledge about such things as
good strategy and tactics could of course help considerably to constrain the search and
speed up the execution of the program.
30. What is alpha-beta pruning?
Alpha - Beta Pruning is a search algorithm that seeks to decrease the number of nodes
that are evaluated by the minmax algorithm in its search tree. When applied to a standard
minmax tree, it returns the same move as minmax would, but the final decision.t prunes
away branches that cannot possibly influence.

31. What do you mean by local maxima with respect to search technique?
Local maxima are a peak that is higher than each of its neighboring states, but lower than the
global maximum. Eg: Hill climbing algorithms that reach the vicinity of a local maximum will be
drawn towards the peak, but will then be stuck with nowhere else to go.

32. How can we avoid ridge and plateau in hill climbing?

Ridges result in sequence of local maxima that is very difficult for greedy algorithm to
navigate. A plateau is an area to the state space landscape where the evaluation function
is flat. It can be a flat local maximum, from which no uphill exit exists, or a shoulder,
from which it is possible to make progress. In case of plateau a sideways move is allowed
in hope that the plateau is really a shoulder. If a sideways move is always allowed an
infinite loop might occur. So a limit is placed on the number of consecutive sideways
moves allowed.

33. Define Simulated annealing.

Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of
a given function. Specifically, it is a meta heuristic to approximate global optimization in a
large search space for an optimization problem. It is often used when the search space is
discrete (e.g., the traveling salesman problem). For problems where finding an approximate
global optimum is more important than finding a precise local optimum in a fixed amount of
time.

34. Define Local beam search.

Local beam search keeps track of k states rather than just one. It begins with k randomly
generated states. At each step, all the successors of all ‘k’ states are generated. If anyone is a
goal, the algorithm halts. Otherwise it selects the ‘k’ best successors from the complete list and
repeats.
35. Define stochastic beam search.
Stochastic beam search chooses ‘k’ successors at random, with the probability of choosing a
given successor being an increasing function of its value. It bears some resemblance to the
process of natural selection, whereby the successors of a state populate the next generation
according to its value.

36. Give a classification of CSP with respect to constraints.

The classification of CSP with respect to constraints are as follows
• Unary constraint CSP restricts the value of a single variable.
• Binary constraint CSP relates two variables
• Global constraint CSP involves an arbitrary number of variables.

37. List out the types of assignment in CSP problem and explain each.

• Consistent or legal assignment an assignment that does not violate any constraints
• Complete assignment is one in which every variable is assigned and a solution
to a CSP is consistent.
• Partial assignment assigns values to only some of the variables.
38. Define node consistency, arc consistency and path consistency.
Node consistency means that each individual variable by itself is consistent;
Path consistency means a pair of adjacent variables can always be extended to a third
neighbouring variable. Arc consistency refers to a directed arc in the constraint graph, the arc
is consistent, if for every value of ‘x’ there is some value ‘y’ that is consistent with ‘x’.

39. What are the various heuristics used for variable ordering and value ordering in
CSP?
The heuristics available for variable ordering are
a. Minimum remaining values (MRV) heuristic
b. Degree heuristic
The heuristics available for value ordering are Least-constraining value heuristic

PART B

1. Explain uninformed search strategies with example.

2. Explain briefly the various problem characteristics.
3. What are the problems encountered during hill climbing and what
are the ways available to deal with these problems?
4. Write A* algorithm and discuss briefly the various observations about algorithm.
5. Write in detail about the constraint satisfaction procedure with map coloring example.
6. Explain how the steepest accent hill climbing works and Heuristic Functions?
7. Write in detail about Generate and Test and Simple Hill Climbing.
8. Discuss the memory bounded heuristic search.
9. Discuss about Greedy best-first search and A* search .
10. Explain in detail about models for predicate logic
11. Explain the nature of heuristics with an example. What is the effect
of heuristic accuracy on performance?
12. Write a simple back tracking algorithm for constraint satisfaction problems.
13. Explain constraint satisfaction problem in detail.
14. Explain the components of problem definition with example.
15. Describe Alpha Beta Pruning with Algorithm.
16. Explain Stochastic Games with examples
 MODULE-III
PART-A

1. Define FOL.
FOL is a first order logic. It is a representational language of knowledge which is powerful than
propositional logic (i.e.) Boolean Logic. It is an expressive, declarative, compositional language.

2. Define a knowledge Base:

Knowledge base is the central component of knowledge base agent and it is described as aset of
representations of facts about the world.

3. With an example, show objects, properties functions and relations.

Example
“EVIL KING JOHN BROTHER OF RICHARD RULED ENGLAND IN 1200”
Objects : John, Richard, England, 1200
Relation : Ruled
Properties : Evil, King
Functions : BROTHER OF

4. Define a Sentence?
Each individual representation of facts is called a sentence. The sentences are expressed in a language called
as knowledge representation language.

5. Define an inference procedure

An inference procedure reports whether or not a sentence is entiled by knowledge base provided a
knowledge base and a sentence .An inference procedure ‘i’ can be described by the sentences that it can
derive. If i can derive from knowledge base, we can write. KB --Alpha is derived from KB or i derives
alpha from KB.

6. Define Ontological commitment.

The difference between propositional and first order logic is in the ontological commitment. It assumes
about the nature of reality.

7. Define domain and domain elements.

The set of objects is called domain, sometimes these objects are referred as domain elements.

8. Define Syntax.
Syntax is the arrangement of words. Syntax of a knowledge describes the possible configurations
that can constitute sentences. Syntax of the language describes how to make sentences.

9. Define Semantics.
The semantics of the language defines the truth of each sentence with respect to each possible
world. With this semantics, when a particular configuration exists with in an agent, the agent
believes the corresponding sentence.

10. Define Logic.

Logic is one which consist of
i. A formal system for describing states of affairs, consisting of a) Syntax
b)Semantics.
ii. Proof Theory – a set of rules for deducing the entailment of a set sentences.
11. What are the 3 types of symbol which is used to indicate objects, relations and functions?
i) Constant symbols for objects
ii) Predicate symbols for relations
iii) Function symbols for functions

12. Define terms.

A term is a logical expression that refers to an object. We use 3 symbols to build a term.

13. Define Atomic sentence.

Atomic sentence is formed by both objects and relations.
Example
Brother (William, Richard) William is
the brother of Richard.

14. Define Quantifier and it’s types.

Quantifiers are used to express properties of entire collection of objects rather than representing
the objects by name.
Types:
i. Universal Quantifier
ii. Existential Quantifier
iii. Nested Quantifier.

15. What are the two we use to query and answer in knowledge base?
ASK and TELL.

16. Define skolem constant.

The existential sentence says there is some object satisfying a condition, and the instantiation
process is just giving a name to that object. That name must not belong to another object. The
new name is called skolem constant.
19 . Define a Proof.
A sequence of application of inference rules is called a proof. Finding proof is exactly finding
solution to search problems. If the successor function is defined to generate all possible
applications of inference rules then the search algorithms can be applied to find proofs.

20. Define a Complete inference procedure

An inference procedure is complete if it can derive all true conditions from a set of premises.

21. Define Interpretation.

Interpretation specifies exactly which objects, relations and functions are referred to by the
constant predicate, and function symbols.

22. Define Modus Ponen’s rule in Propositional logic?

The standard patterns of inference that can be applied to derive chains of conclusions that lead
tothe desired goal is said to be Modus Ponen’s rule.

23. Define Unification.

Lifted Inference rule require finding substitutions that make different logical expressions
lookidentical (same). This is called Unification.

24. Define pattern matching.

The inner loop of an algorithm involves finding all the possible unifiers with facts in the KB.This
is called pattern matching.
25. Define backward chaining.
This algorithm works backward from the goal, chaining through rules to find known facts
thatsupport the proof.

26. Define Prolog program.

It is a set of definite clauses written in a notation somewhat different from standard FOL.

PART-B
1. Explain the inference process in first order logic, using suitable example Prolog Programming
2. Explain in detail about wumpus world problem in fol.
3. What are the steps to convert first order logic sentence to Normal form? Explain each step.
4. Explain the unification algorithm used for reasoning under predicate logic with an example
5. Explain the forward chaining process and efficient forward chaining in detail with example. What is the
need of incremental forward chaining?
6. Consider the following facts
Team India
Team Australia
Final match between India and Australia
India scored 350 runs, Australia scored 350 runs, India lost 5 wickets, Australia lost 7 wickets. The
team which scored the maximum runs wins.
If the scores are same the team which lost minimum wickets wins the match.
Represent the facts in predicate, convert to clause form and prove by resolution “India wins the match”.
7. Describe the steps involved in the knowledge engineering process with example. Give the five logical
connectives used to construct complex sentences and give the formal grammar of propositional logic.
8. Consider the following facts and represent them in predicate form:
F1. There are 500 employees in ABC company.
F2. Employees earning more than Rs. 5000 pay tax.
F3. John is a manager in ABC company.
F4. Manager earns Rs. 10,000.
Convert the facts in predicate form to clauses and then prove by resolution: “John pays tax”.
9. Explain Ontological Engineering Categories and Objects – Events - Mental Events and Mental
Objects
10. Write a short note on Reasoning Systems for Categories.
11. Explain briefly Reasoning with Default Information
12. Explain with an example the use of unification algorithm to prove the concept of resolution.
13. (i). Discuss backward chaining algorithm. (ii).Explain the algorithm for computing more general
unifiers.
14. How did you describe Resolution ? How would you identify an example for resolution?
15. Consider the following sentences:
John like all kinds of food
Apples are food
Chicken is food
Anything anyone eats and isn’t killed is food Bill
eats peanuts and still alive
Sue eats everything Bill eats
Translate these sentences into formulae in predicate logic. (ii)Convert the above FOL into clause form