In the SATPLAN algorithm in Figure, each call to the satisfiability algorithm asserts a goal g T where T ranges from 0 to Tmax. Suppose instead that the satisfiability algorithm is called only once, with the goal g0 V g1 V.. Vg T max
a. Will this always return a plan if one exists with length less than or equal to Tm?
b. Does this approach introduce any new spurious “solutions”?
c. Discuss how one might modify a satisfiability algorithm such as WALKSAT so that it finds short solutions (if they exist) when given a disjunctive goal of thisform.

  • CreatedFebruary 14, 2011
  • Files Included
Post your question