×

Knowledge and reasoning in program synthesis. (English) Zbl 0303.68012


MSC:

68N01 General topics in the theory of software
68T10 Pattern recognition, speech recognition
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Balzer, R. M., Automatic programming, (Institute Technical Memo (September 1972), Information Sciences Institute, University of Southern California: Information Sciences Institute, University of Southern California Los Angeles, Calif)
[2] Biermann, A. W.; Baum, R.; Krishnaswamy, R.; Petry, F. E., Automatic program synthesis reports, (Computer and Information Sciences Technical Report TR-73-6 (October 1973), Ohio State University: Ohio State University Columbus, Ohi)
[3] Bobrow, D. G.; Wegbreit, B., A model for control structures for artificial intelligence programming languages, (Adv. Papers 3rd Intl. Conf. on Artificial Intelligence (August 1973), Stanford University: Stanford University Stanford, Calif), 246-253
[4] Boyer, R. S.; Moore, J. S., Proving theorems about lisp functions, (Adv. Papers 3rd Intl. Conf. on Artificial Intelligence (August 1973), Stanford University: Stanford University Stanford, Calif), 486-493
[5] Buchanan, J. R.; Luckham, D. C., On automating the construction of programs, Memo, Stanford Artificial Intelligence Project, Stanford, Calif. (March 1974)
[6] Bundy, A., Doing arithmetic with diagrams, (Adv. Papers 3rd Intl. Conf. on Artificial Intelligence (August 1973), Stanford University: Stanford University Stanford, Calif), 130-138
[7] Darlington, J.; Burstall, R. M., A system which automatically improves programs, (Adv. Papers 3rd Intl. Conf. on Artificial Intelligence (August 1973), Stanford University: Stanford University Stanford, Calif), 479-485 · Zbl 0395.68017
[8] Floyd, R. W., Assigning meanings to programs, (Schwartz, J. T., Proc. of a Symposium in Applied Mathematics, 19 (1967), Am. Math. Soc: Am. Math. Soc Providence, R.I), 19-32 · Zbl 0189.50204
[9] Gelernter, H., Realization of a geometry-theorem proving machine, (Computers and Thought (1963), McGraw-Hill: McGraw-Hill New York), 134-152 · Zbl 0114.06901
[10] Green, C. C., Application of theorem proving to problem solving, (Proc. Intl. Joint Conf. on Artificial Intelligence. Proc. Intl. Joint Conf. on Artificial Intelligence, Washington, D.C. (May 1969)), 219-239
[11] Green, C. C.; Waldinger, R. J.; Barstow, D. R.; Elschlager, R.; Lenat, D. B.; McCune, B. P.; Shaw, D. E.; Steinberg, L. I., Progress report on program-understanding systems, Memo, Stanford Artificial Intelligence Project, Stanford, Calif. (August 1974)
[12] Hardy, S., Automatic induction of lisp functions, (AISB Summer Conference (July 1974), University of Sussex: University of Sussex Brighton), 50-62
[13] Hewitt, C., Description and theoretical analysis (using schemata) of planner: A language for proving theorems and manipulating models in a robot, (AI Memo No. 251, Project MAC (April 1972), M.I.T: M.I.T Cambridge, Mass)
[14] Hoare, C. A.R., An axiomatic basis for computer programming, Comm. ACM, 12, 10, 583 (October 1969) · Zbl 0179.23105
[15] Kowalski, R., Logic for problem solving, (Memo No. 75 (March 1974), Department of Computational Logic, University of Edinburgh: Department of Computational Logic, University of Edinburgh Edinburgh) · Zbl 0426.68002
[16] Luckham, D.; Buchanan, J. R., Automatic generation of programs containing conditional statements, Memo, Stanford Artificial Intelligence Project, Stanford, Calif. (March 1974)
[17] Manna, Z., Mathematical Theory of Computation (1974), McGraw-Hill: McGraw-Hill New York · Zbl 0353.68066
[18] Manna, Z.; Waldinger, R., Toward automatic program synthesis, Comm. ACM, 14, 3, 151-165 (March 1971) · Zbl 0214.43006
[19] McCarthy, J., Towards a mathematical science of computation, (Proc. IFIP Congress 62 (1962), North Holland: North Holland Amsterdam), 21-28
[20] Reboh, R.; Sacerdoti, E., Tech. Note 81, (A preliminary qlisp manual (August 1973), Artificial Intelligence Center, Stanford Research Institute: Artificial Intelligence Center, Stanford Research Institute Menlo Park, Calif)
[21] Robinson, J. A., A machine-oriented logic based on the resolution principle, J. ACM, 12, 1, 23-41 (January 1965) · Zbl 0139.12303
[22] Rulifson, J. F.; Derksen, J. A.; Waldinger, R. J., QA4: A procedural calculus for intuitive reasoning, (Tech. Note 73 (November 1972), Artificial Intelligence Group, Stanford Research Institute: Artificial Intelligence Group, Stanford Research Institute Menlo Park, Calif)
[23] Simon, H. A., Experiments with a heuristic compiler, J. ACM, 10, 4, 493-506 (October 1963) · Zbl 0113.32704
[24] Sussman, G. J., A computational model of skill acquisition, (Ph.D. Thesis (August 1973), Artificial Intelligence Laboratory, M.I.T: Artificial Intelligence Laboratory, M.I.T Cambridge, Mass)
[25] Teitelman, W., (INTERLISP Reference Manual (1974), Xerox: Xerox Palo Alto, Calif)
[26] Waldinger, R. J.; Lee, R. C.T., PROW: A step toward automatic program writing, (Proc. Intl. Joint Conf. on Artificial Intelligence. Proc. Intl. Joint Conf. on Artificial Intelligence, Washington, D.C. (May 1969)), 241-252
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.