Not enough data to create a plot.
Try a different view from the menu above.
Formal description of program structure and semantics in first order logic
Machine Intelligence 5. B. Meltzer & D. Michie (eds.), 78-98. Edinburgh: Edinburgh University Press.
Heuristic Programming: Ill Structured Problems
in Arnofsky, Julius S. (ed), Progress in Operations Pesearch III. New York: Wiley & Sons.
PROW: A step toward automatic program writing
In Walker, D. E. & Norton, L. N. (eds. ), IJCAI 1969: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, May 7-9, 1969 Washington, D. C., pp. 241-252
COMPUTER SOLUTION OF CALCULUS WORD PROBLEMS
A program was writte n to solve calculus word problems. The program, CARPS (CAlculus Rate Problem Solver), is restricte d to rate problems. The overall plan of the program is simila r to Bobrow's STUDENT, the primary difference being the introductio n of "structures " as the internal model in CARPS. Structures are stored internally as trees, each structure holding the information gathered about one object.In Walker, D. E. & Norton, L. N. (eds. ), IJCAI 1969: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, May 7-9, 1969 Washington, D. C., pp. 241-252
Applications of theorem-proving to problem-solving
In Walker, D. E. & Norton, L. N. (eds. ), IJCAI 1969: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, May 7-9, 1969 Washington, D. C., pp. 219-39.
Toward a Programming Laboratory
In IJCAI 1969: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, May 7-9, 1969 Washington, D. C.
PLANNER: a language for proving theorems in robots
PLANNER is a language for proving theorems and manipulating models in a robot. The language is built out of a number of problem solving primitives together with a hierarchical control structure. Statements can be asserted and perhaps later withdrawn as the state of the world changes. Conclusions can be drawn from these various changes in state. Goals can be established and dismissed when they are satisfied . The deductive system of PLANNER is subordinate to the hierarchical control structure in order to make the language efficient . The use of a general purpose matching language makes the deductive system more powerful. In IJCAI-69, pp. 295-ยย301.
Artificial Intelligence: Themes in the Second Decade
See also: Education Resources Information CenterSupplement to Proceedings of the IFIP 68 International Congress, Edinburgh, August 1968. Published in A. J. H. Morrell (ed.), Information Processing 68, Vol. II, pp. 1008-1022, Amsterdam: North-Holland, 1969.
A Conceptual Dependency Representation for a Computer-Oriented Semantics
Stanford AI Memo 83 or Computer Science Technical Note 130, Computer Science Department, Stanford University, Stanford, CA, 1969