Synthesis by Completion

Dershowitz, Nachum

Synthesis by Completion

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 208-213.

Abstract

The Knuth-Bendix completion procedure was introduced as a means of deriving canonical term-rewriting systems to serve as decision procedures for given equational theories. The procedure generates new rewrite rules to resolve ambiguities resulting from existing rules that overlap. We propose using this procedure to synth es ize logic programs, as well as functional programs, from specifications and domain knowledge expressed as equivalencepreserving rewrite rules. An implementation is underway.

Nachum Dershowitz. 1985. Synthesis by Completion. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 208–213. https://ijcai.org/proceedings/1985/38

@inproceedings{ijcai1985p38,
  title     = {Synthesis by Completion},
  author    = {Dershowitz, Nachum},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {208--213},
  year      = {1985},
  note      = {Automatic Programming},
  url       = {https://ijcai.org/proceedings/1985/38},
}

TY  - CPAPER
TI  - Synthesis by Completion
AU  - Dershowitz, Nachum
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 208
EP  - 213
UR  - https://ijcai.org/proceedings/1985/38
ER  -