Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is planning as satisfiability?

  • A.Testing whether each action's preconditions can be satisfied
  • B.Using a satisfiability solver to verify a plan after it is found
  • C.Encoding a bounded length plan as a propositional formula
  • D.Checking whether the planning problem has any solution at all

Answer: C

Fixing a horizon and encoding the initial state, the goal and the action semantics at each step gives a formula satisfiable exactly when a plan of that length exists, and the horizon is increased until one is found. The approach exploits the enormous speed of modern solvers. Solvability, precondition checking and verification are different questions. Handing a problem to a tool with better engineering, by encoding it, is a strategy worth considering whenever such a tool exists.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.