Explanation: None. 3. __________ algorithm translates a planning problem in to prepositional axioms.
A. GraphPlan
B. SatPlan
C. Greedy
D. None of the mentioned
Answer:A
Explanation: None. 3. __________ algorithm translates a planning problem in to prepositional axioms.
A. GraphPlan B. SatPlan C. Greedy D. None of the mentioned
Explanation: The SATPLAN algorithm translates a planning problem into propositional axioms and applies a satisfiability algorithm to find a model that corresponds a valid plan. 4. Which can be adapted for planning algorithm?