__________ algorithm translates a planning problem in to prepositional – McqOptions

MCQOPTIONS

1.	__________ algorithm translates a planning problem in to prepositional axioms.
A.	GraphPlan
B.	SatPlan
C.	Greedy
D.	None of the mentioned
Answer» C. Greedy

Discussion

No Comment Found

Related MCQs

In partial order plan.A. Relationships between the actions of the behavior are set prior to the actionsB. Relationships between the actions of the behavior are not set until absolutely necessaryChoose the correct option.
Planning graphs works only for prepositional planning problems.
One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.
What are you predicating by the logic: ?x: €y: loyalto(x, y).
_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic.
__________ algorithm translates a planning problem in to prepositional axioms.
____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.
Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow.
Planning problem can be described as a propositional logic.
A re planning agent uses execution monitoring and splices in repairs as needed.