Programs with common sense
This is the first clear call for the separation of knowledge and inference procedure in AI. In this paper McCarthy advocates using predicate logic as a declarative representation of knowledge and first-order logic as the inference procedure.Additional notes on this landmark paper at http://www-formal.stanford.edu/jmc/mcc59/mcc59.html.Bar-Hilel's comments in the discussion section from the conference are also interesting:"PROF. Y. BAR-HILLEL: Dr. McCarthy's paper belongs in the Journal of Half-Baked Ideas, the creation of which was recently proposed by Dr. I. J. Good. Dr. McCarthy will probably be the first to admit this. Before he goes on to bake his ideas fully, it might be well to give him some advice and raise some objections. He himself mentions some possible objections, but I do not think that he treats them with the full consideration they deserve; there are others he does not mention.For lack of time, I shall not go into the first part of his paper, although I think that it contains a lot of highly unclear philosophical, or pseudo-philosophical assumptions. I shall rather spend my time in commenting on the example he works out in his paper at some length. Before I start, let me voice my protest against the general assumption of Dr. McCarthy -- slightly caricatured -- that a machine, if only its program is specified with a sufficient degree of carelessness, will be able to carry out satisfactory even rather difficult tasks."In Proceedings of the Symposium on the Mechanization of Thought Processes, National Physical Laboratory 1:77-84
Pandemonium: A Paradigm for Learning
A significant prcursor to the Blackboard Model of problem solving. In D. V. Blake and A. M. Uttley (eds.), Proceedings of the Symposium on Mechanisation of Thought Processes, pp, 511-529, London: Her Majesty's Stationary Office, 1959
Tigris and Euphrates: A comparison between human and machine translation
Teddington Conference
The Logic of Scientific Discovery
The Wageningen University & Research Library Catalogue contains a.o. the titles of the books and journals held by the participating libraries. Journal articles are not included in this database. Subjects covered include Agrotechnology, Food and Food Production, Plant and Animal Sciences, Soil Science, Geo-information, Landscape and Spatial Planning, Water and Climate, Ecosystem Studies, Economics and Society. The catalogue is updated daily and contains over 700.000 records.
Realization of a geometry theorem-proving machine
... the technique of heuristic programmingis under detailed investigation as a means to the end of applying largescaledigital computers to the solution of a difficult class of problems currentlyconsidered to be beyond their capabilities; namely those problemsthat seem to require the agent of human intelligence and ingenuity fortheir solution. It is difficult to characterize such problems further, except,perhaps, to remark rather vaguely that they generally involve complexdecision processes in a potentially infinite and uncontrollable environment.If, however, we should restrict the universe of problems to those thatamount to the discovery of a proof for a theorem in some well-definedformal system, then the distinguishing characteristics of those problems ofspecial interest to us are brought clearly into focus.Proceedings of an International Conference on Information Processing. Paris:UNESCO House, 273-282.
To what extent can administration be mechanized?
Merriman, J.H.H. | Wass, D.W.G.
Teddington Conference
