Inductive Synthesis of Equational Programs
Abstract
An equational approach to the synthesis of functional and logic program is taken. In this context, the synthesis task involves nding executable equations such that the given speci cation holds in their standard model. Hence, to synthesize such programs, induction is necessary. We formulate procedures for inductiveproof, aswell as for program synthesis, using the framework of \\ordered rewriting". We also propose heuristics for generalizing from a sequence of equational consequences. These heuristics handle cases where the deductive process alone is inadequate for coming up with a program. 1.
Cite
Text
Dershowitz and Pinchover. "Inductive Synthesis of Equational Programs." AAAI Conference on Artificial Intelligence, 1990.Markdown
[Dershowitz and Pinchover. "Inductive Synthesis of Equational Programs." AAAI Conference on Artificial Intelligence, 1990.](https://mlanthology.org/aaai/1990/dershowitz1990aaai-inductive/)BibTeX
@inproceedings{dershowitz1990aaai-inductive,
title = {{Inductive Synthesis of Equational Programs}},
author = {Dershowitz, Nachum and Pinchover, Eli},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1990},
pages = {234-239},
url = {https://mlanthology.org/aaai/1990/dershowitz1990aaai-inductive/}
}