Unit

3
3

4
4

4
4

4
4

5
5

5
Question
Show What if MIN does not play optimally?
Find the proper meaning of alpha and beta used in alpha-beta pruning algorithm.

Design a (partial) game tree for the game of tic-tac-toe.

Build (a) The principal states and territories of Australia. Coloring this map can be viewed as a constraint
satisfaction problem (CSP). The goal is to assign colors to each region so that no neighboring regions have
the same color. (b) The map-coloring problem representedas a constraint graph.
Model the first three plies of a game tree with three players (A, B, C) using alpha beta pruning strategy.

Imagine you're designing a scheduling system for a university where courses must be assigned to
classrooms and timeslots. How would you apply inference techniques in CSP to optimize this scheduling
process? Provide a detailed plan outlining how inference could help reduce the search space and improve
efficiency in finding a feasible schedule..(15 marks)

For the following map apply CSP such that no adjacent two countries have the same color.Use red,
blue,green for colors.How many solutions are there.(8 marks)

Discuss the online search agent which is an necessary idea for an unknown environments.In this state of
ignorance the agent faces an exploration problem and must use its actions as experiments in order to learn
enough to make deliberation worthwhileExplain it with simple maze problem. .(7 marks)

Define topological sorting with example.

Explain the BNF (Backus–Naur Form) grammar of sentences in propositional logic, along with operator
precedences from highest to lowest.
Explain about truth tables for the five logical connectives. To use the table to compute, for example, the
value of P ∨ Q when P is true and Q is false, first look on the left for the row where P is true and Q is false
(thethirdrow). Then look innthat row under the P ∨Q column to see the result: true.

Illustrate (a) The constraint graph of a tree-structuredCSP. (b)A linear ordering of the variables consistent
with the tree with A as the root. This is known as a topological sort of the variables.

Show the generic knowledge-based agent. Given a percept, the agent adds the percept to its knowledge
base, asks the knowledge base for the best action, and tells the knowledge base that it has in fact taken that
action.
Model the sentences which are a physical configurations of the agent, and reasoning is a process of
constructing new physical configurations from old ones. Logical reasoning should ensure that the new
configurations represent aspects of the world that actually follow from the aspects that the old
configurations represent.

Identify one final property of logical systems is monotonicity, which says that the set of en-MONOTONICITY
tailed sentences can only increase as information is added to the knowledge base.8 For any sentences α and
β,

Build the standard logical equivalences with the symbols α, β, and γ stand for arbitrary sentences of
propositional logic.
Model a two-step solution using min-conflicts for an 8-queens problem.

Identify a simple resolution algorithm for propositional logic. The function PL-RESOLVE returns the set of all
possible clauses obtained by resolving its two inputs.

Consider a 4x4 grid representing the Wumpus World, where the agent has to navigate through rooms, avoid pits, and
kill the Wumpus to retrieve the gold. Each room can be either safe, contain a pit, or contain the Wumpus. The agent
receives a -1 reward for each move and a -10 reward for falling into a pit or being eaten by the Wumpus. The agent
receives a +100 reward for grabbing the gold. The agent's goal is to maximize its total reward while avoiding hazards.
(a) Explain the basic elements of the Wumpus World problem, including the agent's actions, percept, and
environment model.
(b) Discuss how the Wumpus World problem can be formulated as a Markov Decision Process (MDP), identifying the
states, actions, rewards, and transition probabilities.
(c) Implement a simple agent that utilizes a depth-first search algorithm to navigate the Wumpus World environment.
Discuss the advantages and limitations of using depth-first search in this context, considering factors such as
completeness, optimality, and efficiency.(15 marks)
a) Encode general knowledge of the domain one sign that we have a good ontology is that we require only a
few general rules, which can be stated clearly and concisely. These are all the axioms we will need:
1. If two terminals are connected, then they have the same signal:
2. The signal at every terminal is either 1 or 0:
3. Connected is commutative:
4. There are four types of gates:
5. An AND gate’s output is 0 if and only if any of its inputs is 0:
6. An OR gate’s output is 1 if and only if any of its inputs is 1
7. An XOR gate’s output is 1 if and only if its inputs are different:
8. A NOT gate’s output is different from its input
9. The gates (except for NOT) have two inputs and one output
10. A circuit has terminals, up to its input and output arity, and nothing beyond its arity:
11. Gates, terminals, signals, gate types, and Nothing are all distinct.
12. Gates are circuits.

b)Encode the specific problem instance

The circuit shown in figure is encoded as circuit C1 with the following description. First,
we categorize the circuit and its component gates,Then, show the connections between them.(15 marks)

Develop the following sentences in first-order logic, using a consistent vocabulary (which you must define):

a. Some students took French in spring 2001.

b. Every student who takes French passes it.

c. Only one student took Greek in spring 2001.
d. The best score in Greek is always higher than the best score in French.
e. Every person who buys a policy is smart.
f. No person buys an expensive policy.
g. There is an agent who sells policies only to people who are not insured There is a barber who shaves all
men in town who do not shave themselves.
i. A person born in the UK, each of whose parents is a UK citizen or a UK resident, is a
UK citizen by birth.
j. A person born outside the UK, one of whose parents is a UK citizen by birth, is a UK
citizen by descent.
k. Politicians can fool some of the people all of the time, and they can fool all of the people
some of the time, but they can’t fool all of the people all of the time.
l. All Greeks speak the same language. (Use Speaks(x, l) to mean that person x speaks
language l)(8 Marks)
In the realm of knowledge and reasoning, the concepts of unification and lifting play crucial roles in
enhancing understanding and problem-solving capabilities. Explain the significance of unification and lifting
in knowledge representation and reasoning, and discuss how they can be applied to address challenges in
these domains. Provide examples to illustrate your explanation.(7 marks)

Define classical planning.

Explainthe three conditions holds on which mutex relation holds between two actions at a given level .

Mention the action schema for flying a plane from one location to another.

Show key idea in defining heuristics is decomposition.

Use the diagramatic representation of action, precondition, effect to develop the planning graph for the “ha

Identify some of the top-performing systems in the international planning competition.

Model the situations as the results of actions in the wumpus world.

Build the tire problem expressed as an empty plan.

Build the tire problem for incomplete partially ordered plan. Boxes represent actions and arrows indicate th

Build the tire problem for a complete partially-ordered solution.

Illustrate the hierarchichal planning for problem solving and planning methods with a fixed set of atomic
actions given an additional key aspect of two high level actions such as going to San Francisco airport and
navigating in the vacuum world and searching for a primitive and abstract solution .(15 marks)

Make use of the following sensorless planning,contingent planning,online replanning to make planning and
acting in real world and non deterministic domains.(15 marks)
The monkey-and-bananas problem is faced by a monkey in a laboratory with some bananas hanging out of
reach from the ceiling. A box is available that will enable the monkey to reach the bananas if he climbs on it.
Initially, the monkey is at A, the bananas at B, and the box at C. The monkey and box have height Low, but if
the monkey climbs onto the box he will have height High, the same as the bananas. The actions available to
the monkey include Go from one place to another, Push an object from one place to another, ClimbUp onto
or ClimbDown from an object, and Grasp or Ungrasp an object. The result of a Grasp is that the monkey
holds the object if the monkey and object are in the same place at the same height.
a.
Write down the initial state description b. Write the six action schemas.
c. Suppose the monkey wants to fool the scientists, who are off to tea, by grabbing the
bananas, but leaving the box in its original place. Write this as a general goal (i.e., not
assuming that the box is necessarily at C) in the language of situation calculus. Can this
goal be solved by a classical planning system?
d. Your schema for pushing is probably incorrect, because if the object is too heavy, its
position will remain the same when the Push schema is applied. Fix your action schema
to account for heavy objects.(8 marks)

Utilize temporal constraints representation to optimize the scheduling of tasks in a job-shop setting,
ensuring efficient utilization of resources and minimizing job completion times? Provide a step-by-step
explanation of how you would implement this approach in a real-world scenario, considering factors such as
task dependencies, resource availability, and scheduling constraints.(7 marks)
Mark
2

2
2

15

2
2

15
15

8
7

15

15
8