Planning algorithms use descriptions in some formal language, usually first$-$order logic or a subset thereof. The first key idea behind planning is to "open up $"$ the representation of

A$.$ States

B$.$ Actions

C$.$ Beliefs

D$.$ Goals

$1$ point

Situation calculus is a dialect of First Order Logic. Which of the following statements hold for situation calculus?

A$.$ Situations and actions are explicitly taken to be objects in the domain.

B$.$ Only way to represent beliefs about a changing world.

C$.$ Successor$-$state axiom specifies truth value of fluent in the next state as a function of the action and truth value in the current state.

D$.$ All of the above.

$1$ point

STRIPS is an alternative representation to the pure situation calculus for planning. I. Actions are not represented explicitly as part of the world model. II$.$ Actions are effectively instantaneous. III. Actions are thought of as operators that syntactically transform world models. Which of the above statements are correct?

A$.$ Only Statements I and II

B$.$ Statements I, II and III

C$.$ Only Statements II and III

D$.$ None.

$1$ point

ABSTRIPS greatly reduces search space, and is more efficient at solving large problems. It is a kind of $\_\_\_\_\_\_\_\_\_\_\_\_\_$ planner.

A$.$ State$-$space

B$.$ Regular

C$.$ Hierarchical

D$.$ Advanced

$1$ point

GraphPlan is a two$-$phase algorithm: Planning Graph Construction followed by Solution Extraction. Which of the following does the first stage achieve?

A$.$ Delimiting the search space.

B$.$ Check if a solution can be extracted.

C$.$ Some kind of reachability analysis on the given problem.

D$.$ The graph is treated as a constraint satisfaction problem.

$1$ point

Assertion A: A conflict is called a mutex condition, which means that a pair of literal or pair of operators is mutually exclusive.

Reason R: For such a pair, both cannot be chosen simultaneously without leading to some kind of conflict.

A$.$ Both A and R are true and R is the correct explanation for A

B$.$ Both A and R are true but R is not the correct explanation for A

C$.$ A is True but R is False

D$.$ A is false but R is True

$1$ point

A plan graph is layered with a bunch of alternating layers of

i$.\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ and ii$.\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_.$

A$.$ i$.$ propositions; ii$.$ actions

B$.$ i$.$ actions; ii$.$ situations

C$.$ i$.$ situations; ii$.$ functions

D$.$ i$.$ functions; ii$.$ states

$1$ point

Assertion A: Progression and regression planning cannot take advantage of problem decomposition.

Reason R: Progression and regression planning are totally ordered plan search forms.

A$.$ Both A and R are true and R is the correct explanation for A$.$

B$.$ Both A and R are true but R is not the correct explanation for A$.$

C$.$ A is True but R is False.

D$.$ A is false but R is True.

$1$ point

STRIPS make use of a stack that contains both subgoals and actions that have been proposed to satisfy those subgoals. It also relies on a database that describes the current situation, and a set of actions described by precondition, add and delete lists. The reasoning strategy used by STRIPS is $\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

A$.$ Database Planning

B$.$ Goal Stack Planning

C$.$ List Planning

D$.$ Subgoal Planning

$1$ point

For each layer, a mutex relation is defined that indicates which pairs satisfy the mutex condition. A pair, o$,$ o$\text{'}$ in Oi of operators is defined to be mutex if any of these conditions is met:

A$.$ Inconsistent effects: An effect of o is the negated literal of an effect of o$\text{'}.$

B$.$ Interference: An effect of o is the negated literal of a precondition of o$\text{'}.$

C$.$ Trivial Operator: For each possible operator, o$,$ a trivial operator is constructed for which, o$\text{'}$ is the only precondition and effect.

D$.$ Competing needs: A pair of preconditions, one from each of o and o$\text{'},$ are mutex in layer L$\_$i