Synthesis by completion

Authors:
Nachum Dershowitz
Affiliations:
Department of Computer Science, University of Illinois, Urbana, IL
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Year:
1985

Citing 10
Cited 2

A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Derivation of Logic Programs

Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming with Equations

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic for Problem Solving

Logic for Problem Solving
Computer experiments with the REVE term rewriting system generator

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Stop losing sleep over incomplete data type specifications

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
HOPE: An experimental applicative language

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming

Deductive and inductive synthesis of equational programs

Journal of Symbolic Computation - Special issue on automatic programming
Inductive synthesis of equational programs

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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 synthesize logic programs, as well as functional programs, from specifications and domain knowledge expressed as equivalence-preserving rewrite rules. An implementation is underway.