Finding the solution of a dynamic programming problem in polyadic functional equations is shown to be equivalent to searching a minimal cost path in an AND/OR graph. The proof is given in an algebraic framework, and it is based on a commutativity result between solution and interpretation of a symbolic system. This approach is similar to the one used by some authors to prove the equivalence between the operational and denotational semantics of programming languages.
Dynamic programming as graph searching: an algebraic approach
Gnesi S;
1979
Abstract
Finding the solution of a dynamic programming problem in polyadic functional equations is shown to be equivalent to searching a minimal cost path in an AND/OR graph. The proof is given in an algebraic framework, and it is based on a commutativity result between solution and interpretation of a symbolic system. This approach is similar to the one used by some authors to prove the equivalence between the operational and denotational semantics of programming languages.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_434504-doc_155269.pdf
accesso aperto
Descrizione: Dynamic programming as graph searching: an algebraic approach
Dimensione
3.23 MB
Formato
Adobe PDF
|
3.23 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
