Inductive synthesis of equational programs
Pages 234 - 239
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.
References
[1]
Bachmair, L. Proof by consistency in equational theories. In Proceedings of the Third Symposium on Logic in Computer Science, pp. 228-233, Edinburgh, Scotland, July 1988.
[2]
Bachmair, L., Dershowitz, N., and Hsiang, J. Orderings for equational proofs. In Proceedings of the Symposium on Logic in Computer Science, pp. 346-357, Cambridge, MA, June 1986.
[3]
Bachmair, L., Dershowitz, N., and Plaisted, D. A. Completion without failure. In Ait-Kaci, H. and Nivat, M., eds., Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, chap. 1, pp. 1-30, Academic Press, New York, 1989.
[4]
Barr, A. and Feigenbaum, E. A., eds. The Handbook of Artificial Intelligence. William Kaufmann, 1981-1982. Three volumes.
[5]
Boyer, R. S.and Moore, J. S. A lemma driven automatic theorem prover for recursive function theory. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pp. 511-519, Cambridge, MA, 1977.
[6]
Burstall, R. M. and Darlington, J. A transformation system for developing recursive programs. J. of the Association for Computing Machinery, 24(1):44-67, January 1977.
[7]
Dershowitz, N. Applications of the Knuth-Bendix completion procedure. In Proceedings of the Seminaire d'Informatique Theorique, pp. 95-111, Paris, France, December 1982.
[8]
Dershowitz, N. Equations as programming language. In Proceedings of the Fourth Jerusalem Conference on Information Technology, pp. 114-124, IEEE Computer Society, Jerusalem, Israel, May 1984.
[9]
Dershowitz, N. Computing with rewrite systems. Information and Control, 64(2/3):122-157, May/June 1985.
[10]
Dershowitz, N. Synthesis by completion. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pp. 208-214, Los Angeles, CA, August 1985.
[11]
Dershowitz, N. Termination of rewriting. J. of Symbolic Computation, 3(1&2):69-115, February/April 1987. Corrigendum: 4, 3 (December 1987), 409-410.
[12]
Dershowitz, N. Completion and its applications. In AitKaci, H. and Nivat, M., eds., Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, chap. 2, pp. 31-86, Academic Press, New York, 1989.
[13]
Dershowitz, N. and Jouannaud, J. Rewrite systems. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chap. 6, North-Holland, Amsterdam, 1990. In press; available as Rapport 478, LRI, Univ. Paris-Sud, France.
[14]
Dershowitz, N. and Plaisted, D. A. Equational programming. In Hayes, J. E., Michie, D., and Richards, J., eds., Machine Intelligence 11: The logic and acquisition of knowledge, chap. 2, pp. 21-56, Oxford Press, Oxford, 1988.
[15]
Fribourg, L. A strong restriction of the inductive completion procedure. J. Symbolic Computation, 8(3):253-276, 1989.
[16]
Fronhöfer, B. and Furbach, U. Knuth-Bendix completion versus fold/unfold: A comparative study in program synthesis. In Rollinger, C. and Horn, W., eds., Proceedings of the Tenth German Workshop on Artificial Intelligence, pp. 289-300, 1986.
[17]
Ganzinger, H. A completion procedure for conditional equations. In Kaplan, S. and Jouannaud, J., eds., Proceedings of the First International Workshop on Conditional Term Rewriting Systems, pp. 62-83, Orsay, France, July 1987. Vol. 308 of Lecture Notes in Computer Science, Springer, Berlin (1988).
[18]
Huet, G. and Hullot, J. Proofs by induction in equational theories with constructors. J. of Computer and System Sciences, 25:239-266, 1982.
[19]
Jantke, K. P. Algorithmic learning from incomplete information: Principles and problems. In Dassow, J. and Kelemen, J., eds., Machines, Languages, and Complexity (Selected Contributions of the 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 1988), pp. 188-207, 1989. Vol. 381 of Lecture Notes in Computer Science, Springer, Berlin.
[20]
Jantke, K. P. Inductive program synthesis by problem proving and term rewriting. Technical Report, Humbolt Univ. Berlin, Berlin, 1989.
[21]
Kamin, S. and Lévy, J. J. Two generalizations of the recursive path ordering. Unpublished note, Department of Computer Science, University of Illinois, Urbana, IL, February 1980.
[22]
Kirchner, H. Schematization of infinite sets of rewrite rules generated by divergent completion processes. Theoretical Computer Science, 67(2,3):303-332, October 1989.
[23]
Knuth, D. E. and Bendix, P. B. Simple word problems in universal algebras. In Leech, J., ed., Computational Problems in Abstract Algebra, pp. 263-297, Pergamon Press, Oxford, U. K., 1970. Reprinted in Automation of Reasoning 2, Springer, Berlin, pp. 342-376 (1983).
[24]
Kodratoff, Y. and Picard, M. Complétion de systèmes de réécriture et synthèse de programmes à partir deleurs spécifications. Bigre, 35, October 1983.
[25]
Kounalis, E. and Rusinowitch, M. Inductive reasoning in conditional theories. In Okada, M., ed., Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, Montreal, Canada, June 1990. Lecture Notes in Computer Science, Springer, Berlin; to appear.
[26]
Küchlin, W. Inductive completion by ground proof transformation. In Ait-Kaci, H. and Nivat, M., eds., Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, pp. 211-244, Academic Press, New York, 1989.
[27]
Lange, S. Towards a set of inference rules for solving divergence in Knuth-Bendix completion. In Jantke, K. P., ed., Proceedings of the International Workshop on Analogical and Inductive Inference, pp. 304-316, October 1989. Vol. 397 of Lecture Notes in Computer Science, Springer, Berlin.
[28]
Lescanne, P. Computer experiments with the reve term rewriting system generator. In Proceedings of the Tenth ACM Symposium on Principles of Programming Languages, pp. 99-108, Austin, TX, January 1983.
[29]
Manna, Z. and Waldinger, R. J. Synthesis: Dreams → programs. IEEE Transactions on Software Engineering, SE- 5( 4):294-328, July 1979.
[30]
Musser, D. R. On proving inductive properties of abstract data types. In Proceedings of the Seventh ACM Symposium on Principles of Programming Languages, pp. 154-162, Las Vegas, NV, 1980.
[31]
Perdix, H. Program synthesis from specifications. In Jorrand, P. and Sgurev, V., eds., AIMSA, pp. 13-21, North-Holland, 1986.
[32]
Plotkin, G. Lattice theoretic properties of subsumption. Technical Report MIP-R-77, University of Edinburgh, Edinburgh, Scotland, 1970.
[33]
Reddy, U. S. On the relationship between logic and functional languages. In DeGroot, D. and Lindstrom, G., eds., Logic Programming: Functions, Relations, and Equations, pp. 3-36, Prentice-Hall, Englewood Cliffs, NJ, 1986.
[34]
Reddy, U. S. Rewriting techniques for program synthesis. In Dershowitz, N., ed., Proceedings of the Third International Conference on Rewriting Techniques and Applications, pp. 388-403, Chapel Hill, NC, April 1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin.
[35]
Reddy, U. S. Term rewriting induction. In Stickel, M., ed., Proceedings of the Ninth International Conference on Automated Deduction, Kaiserslautern, West Germany, July 1990. Lecture Notes in Computer Science, Springer, Berlin; to appear.
[36]
Shapiro, E. Y. Algorithmic Program Debugging. MIT Press, Cambridge, MA, 1983.
[37]
Smith, D. R. A survey of synthesis of Lisp programs from examples. In International Workshop on Program Construction, Bonas, France, September 1980.
[38]
Stickel, M. E. A case study of theorem proving by the Knuth Bendix method discovering that x3 = x implies ring commutativity. In Shostak, R. E., ed., Proceedings of the Seventh International Conference on Automated Deduction, pp. 248-259, Napa, CA, May 1984. Vol. 170 of Lecture Notes in Computer Science, Springer, Berlin.
[39]
Stickel, M. E. A Prolog technology theorem prover: Implementation by an extended Prolog compiler. In Siekmann, J. H., ed., Proceedings of the Eighth International Conference on Automated Deduction, pp. 573-587, Oxford, England, July 1986. Vol. 230 of Lecture Notes in Computer Science, Springer, Berlin.
- Inductive synthesis of equational programs
Recommendations
Inductive Completeness of Logics of Programs
We propose a new approach to delineating logics of programs, based directly on inductive definition of program semantics. The ingredients are elementary and well-known, but their fusion yields a simple yet powerful approach, surprisingly overlooked for ...
Deductive and inductive synthesis of equational programs
Special issue on automatic programmingAn equational approach to the synthesis of functional and logic program is taken. In this context, the synthesis task involves finding executable equations such that the given specification holds in their standard model. Hence, to synthesize such ...
Second-order equational logic
CSL'10/EACSL'10: Proceedings of the 24th international conference/19th annual conference on Computer science logicWe extend universal algebra and its equational logic from first to second order as follows. 1. We consider second-order equational presentations as specified by identities between second-order terms, with both variables and parameterised metavariables ...
Comments
Information & Contributors
Information
Published In
July 1990
1141 pages
ISBN:026251057X
Sponsors
- AAAI: American Association for Artificial Intelligence
Publisher
AAAI Press
Publication History
Published: 29 July 1990
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in