An improved version of Shapiro's model inference system
We discuss the Model Inference System of E.Y.Shapiro, giving particular attention to the refinement operator which is used during the synthesis of new Prolog clauses. An improved refinement operator which has been found in practice to reduce synthesis times by up to a factor of five is introduced.
Unable to display preview. Download preview PDF.
- M.R.Kennett. Towards Program Synthesis and Debugging. MTR 84/109. 1984. G.E.C. Marconi Research Centre, Chelmsford, U.K.Google Scholar
- R.C. Waters. The Programmer's Apprentice: knowledge based program editing. IEEE Trans. Soft. Eng. SE-8, 1 pp.1–13. 1982.Google Scholar
- C. Rich. Inspection in Programming. TR-604, Artificial Intelligence Laboratory, M.I.T. 1981.Google Scholar
- D. Shaw, W. Swartout C. Green. Inferring Lisp programs from example problems. In Proceedings of the fourth International Joint Conference on Artificial Intelligence. IJCAI 1975.Google Scholar
- E.Y.Shapiro. Algorithmic Program Debugging. M.I.T. Press 1982.Google Scholar
- D.H.D.Warren. Implementing Prolog — Compiling Predicate Logic Programs. D.A.I. Research reports Nos.39,40. University of Edinburgh 1977.Google Scholar
- M.M.Huntbach. Program synthesis by inductive inference. European Conference on Artificial Intelligence ECAI 1986.Google Scholar