Goto

Collaborating Authors

 AI Classics



Elements of a Plan-Based Theory of Speech Acts

AI Classics

A plan for a question required the composition of REQUEST and INFORM and led to the development of two new kinds of informing speech acts, INFORMREF To plan a yes/no question about some proposition P. one should think that the and INFORMIF, and their mediating acts. The INFORMREF acts lead to hearer knows whether P is true or false (or, at least "might know"). An approximate "what," "when," and "where" questions while INFORMIF results in a yes/no representation of AGT2's knowing whether P is true or false is OR (AGT2 question.2' The reason for these new acts is that, in planning a REQUEST that BELIEVE P, AGT2 BELIEVE -- P)).'9 Such goals are often created, as modelled someone else perform an INFORM act, one only has incomplete knowledge of by our type 4 inference, when a planner does not know the truth-value of P. their beliefs and goals; but an INFORM, as originally defined can only be Typical circumstances in which an agent may acquire such disjunctive beliefs planned when one knows what is to be said.


EXPERT SYSTEMS AND Al APPLICATIONS

AI Classics

Another concern has been to exploit (d) detection of metabolic disorders of genetic, developmental, toxic or infectious the AI methodology to understand better some fundamental questions in the origins by identification of organic constituents excreted in abnormal quantities philosophy of science, for example the processes by which explanatory hypotheses in human body fluids.


Non-resolution Theorem Proving '

AI Classics

This talk reviews those efforts in automatic theorem proving, during the past few years, which have theory, very easy for the computer.


The B* Tree Search Algorithm: A Best-First Proof Proceduret

AI Classics

In this paper we present a new algorithm for searching trees. The algorithm, which we have named For this reason, the search is usually limited in some way (e.g., number of nodes B*, finds a proof that an arc at the root of a search tree is better than any other. It does this by to be expanded, or maximum depth to which it may go).



4 CONTENTS 4 z96o

AI Classics

R. L. GREGORY, Psychological Laboratory, Cambridge Discussion on paper 5 683 6 Some questions concerning the explanation of learning 691 in animals MR. A. J. WATS01,4 Psychological Laboratory, Cambridge Discussion on paper 6 721 7 Information, redundancy and decay of the memory trace 729 DR. Y. BAR-HILLEL, The Hebrew University, Jerusalem Discussion on paper 2 801 3 To what extent can administration be mechanized?


APPENDIX I Attendance List

AI Classics

APPENDIX I Attendance List *An asterisk indicates either that the person was a part--time deputy for a delegate, or that their attendance was restricted to particular Sessions by accomodation difficulties.


SESSION 4B PAPER 3

AI Classics

There will, of course, be many problems to be solved before these tasks can be regarded as satisfactorily completed, and before we can speak with confidence out of experience. But these problems do not appear to have any fundamentally insuperable content. The difficul-- ties are manmade rather than intrinsic. They originate in part from the difficulty of adjusting the organisms of office life to new rhythms, new environments, new relationships, in part from imperfect understanding and appreciation of the power and range of new techniques, and in part from a lack of perception of the limitations and deficiencies of these systems. We may reasonably suppose that, during the course of the next five years, these difficulties will be overcome and that, throughout Government Departments and Industry, there will be a growing number of installations at work on these jobs. With this perhaps over--simplified premise, it is not too early to start thinking about a possible future form of A.D.P. in Government Departments in, say, ten or fifteen years' time.


SESSION 4B PAPER 2 THE MECHANIZATION OF LITERATURE SEARCHING

AI Classics

I am quite ready to subscribe to the already mentioned slogan that "whatever a human being can do,an appropriate machine can do, too"; but I do this only because.I regard the slogan as utterly trivial. At the moment, I am not talking about what maohines could do in principle but only about what actually existing or blueprinted machines could do, and it Is with regard to these that I utter my definite opinions. If someone wishes to write sciencefiction about information-processing centres of the (undetermined) future, let him do so and I shall discuss it with him over a glass of beer and even offer some startling suggestions of my own. If he is interested in improving the literature search process today, I would strongly advise him to forget about mechanizing abstracting or indexing. May I add that it is with a good amount of sorrow that I have come to this conclusion which is quite counter, to my temperament and my convictions (never published) of a few years ago.