31. |
Which cannot be taken as advantage for totally ordered plan search?
|
||||||||
Answer:
Option (c) |
32. |
What is the advantage of totally ordered plan in constructing the plan?
|
||||||||
Answer:
Option (b) |
33. |
Which strategy is used for delaying a choice during search?
|
||||||||
Answer:
Option (b) |
34. |
Which algorithm places two actions into a plan without specifying which should come first?
|
||||||||
Answer:
Option (d) |
35. |
What are present in the empty plan?
|
||||||||
Answer:
Option (d) |
36. |
What are not present in finish actions?
|
||||||||
Answer:
Option (b) |
37. |
Which can be adapted for planning algorithms?
|
||||||||
Answer:
Option (a) |
38. |
Which type of planning consists of successive representation of different levels of plan?
|
||||||||
Answer:
Option (b) |
39. |
One of the components of planning system is detecting dead states.
|
||||
Answer:
Option (a) |
40. |
In this planning system, the problem solver makes use of a single stack that contains both goals and operators that have been proposed to satisfy those goals.
|
||||||||
Answer:
Option (c) |