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?
A. Most-constraint variable
B. Most-constraint literal
C. Constraint
D. None of the mentioned
Answer:A
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?
A. Most-constraint variable B. Most-constraint literal C. Constraint D. None of the mentioned
Explanation: The most-constraint variable heuristic from CSPs can be adapted for planning algorithm and seems to work well. 5. ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.