Synthesis of first-order dynamic programming algorithms

  title={Synthesis of first-order dynamic programming algorithms},
  author={Yewen Pu and Rastislav Bod{\'i}k and Saurabh Srivastava},
To solve a problem with a dynamic programming algorithm, one must reformulate the problem such that its solution can be formed from solutions to overlapping subproblems. Because overlapping subproblems may not be apparent in the specification, it is desirable to obtain the algorithm directly from the specification. We describe a semi-automatic synthesizer of linear-time dynamic programming algorithms. The programmer supplies a declarative specification of the problem and the operators that… CONTINUE READING