This progress report covers the first year and one half of work by our automatic-programming research group at the Stanford Artificial Intelligence Laboratory. Major emphasis has been placed on methods of program specification, codification of programming knowledge, and implementation of pilot systems for program writing and understanding. List processing has been used as the general problem domain for this work.
Cited By
- Biermann A and Ballard B (1980). Toward natural language computation, Computational Linguistics, 6:2, (71-86), Online publication date: 1-Apr-1980.
- Biermann A, Ballard B and Holler A (1979). A system for natural language computation, ACM SIGLASH Newsletter, 12:1, (6-16), Online publication date: 1-Mar-1979.
- Summers P A methodology for LISP program construction from examples Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (68-76)
- Green C The design of the PSI program synthesis system Proceedings of the 2nd international conference on Software engineering, (4-18)
- Biermann A The use of examples in program construction and debugging Proceedings of the 1975 annual conference, (242-247)
Recommendations
Domain knowledge graph-based research progress of knowledge representation
AbstractDomain knowledge graph has become a research topic in the era of artificial intelligence. Knowledge representation is the key step to construct domain knowledge graph. There have been quite a few well-established general knowledge graphs. However, ...