## Principles of Inverse Computation and the Universal Resolving Algorithm (2002)

Venue: | IN THE ESSENCE OF COMPUTATION: COMPLEXITY, ANALYSIS, TRANSFORMATION |

Citations: | 13 - 2 self |

### BibTeX

@INPROCEEDINGS{Abramov02principlesof,

author = {Sergei Abramov and Robert Glück},

title = {Principles of Inverse Computation and the Universal Resolving Algorithm },

booktitle = {IN THE ESSENCE OF COMPUTATION: COMPLEXITY, ANALYSIS, TRANSFORMATION},

year = {2002},

pages = {269--295},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

We survey fundamental concept in inverse programming and present the Universal Resolving Algorithm (URA), an algorithm for inverse computation in a first-order, functional programming language. We discusst he principles behind the algorithm, including a three-step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples. We explaint he idea of a semantics modifier for inverse computation which allows us to perform inverse computation in other programming languages via interpreters.