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

The correct answer is A. GraphPlan.

GraphPlan is a planning algorithm that translates a planning problem into a propositional calculus problem. It then uses a SAT solver to find a solution to the propositional calculus problem, which is a solution to the planning problem.

SatPlan is a complete algorithm, which means that it will always find a solution to a planning problem if one exists. However, it can be slow, especially for large planning

Greedy is a heuristic algorithm that does not guarantee to find a solution to a planning problem. However, it is often much

None of the mentioned is not a correct answer.