Inductive synthesis of equational programs

Authors:
Nachum Dershowitz;Eli Pinchover
Affiliations:
Department of Computer Science, University of Illinois, Urbana, IL;Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 20
Cited 2

A PROLOG technology theorem prover: implementation by an extended PROLOG compiler

Proc. of the 8th international conference on Automated deduction
Termination of rewriting

Journal of Symbolic Computation
A completion procedure for conditional equations

1st international workshop on Conditional Term Rewriting Systems
Equational programming

Machine intelligence 11
A strong restriction of the inductive completion procedure

Journal of Symbolic Computation
Schematization of infinite sets of rewrite rules generated by divergent completion processes

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Term rewriting induction

CADE-10 Proceedings of the tenth international conference on Automated deduction
Algorithmic learning from incomplete information: principles and problems

Selected contributions of the fifth international meeting of Young Computer Scientists on Machines, language, and complexity
Rewrite systems

Handbook of theoretical computer science (vol. B)
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Algorithmic Program DeBugging

Algorithmic Program DeBugging
Computer experiments with the REVE term rewriting system generator

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On proving inductive properties of abstract data types

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Knuth-Bendix Completion versus Fold/Unfold: a Comparative Study in Program Synthesis

GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung
Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion

AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity

Proceedings of the 7th International Conference on Automated Deduction
Rewriting Techniques for Program Synthesis

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Synthesis: Dreams ? Programs

IEEE Transactions on Software Engineering
A lemma driven automatic theorem prover for recursive function theory

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Synthesis by completion

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Deductive and inductive synthesis of equational programs

Journal of Symbolic Computation - Special issue on automatic programming
Deciding satisfiability of positive second order joinability formulae

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the given domain rules. To synthesize such programs, induction is necessary. We propose heuristics for generalizing from a sequence of deductive consequences. These are combined with rewrite-based methods of inductive proof to derive provably correct programs.