{"type":"ScholarlyArticle","title":"Synthesis by Completion","authors":[{"name":"Nachum Dershowitz","slug":"nachum-dershowitz","given":"Nachum","family":"Dershowitz","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1985/38","pdf":"https://ijcai.org/proceedings/1985/0038.pdf","markdown":"https://ijcai.org/proceedings/1985/38.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/38","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automatic Programming","track":"Automatic Programming","number":38,"pages":{"first":208,"last":213},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}