Computational Linguistics, 8 (3-4), 139-49.

A ciear and powerful formalism for describing languages, both natural and artificial, follows from a method for expressing grammars in logic due to Colmerauer and Kowalski. This formalism, which is a natural extension of context-free grammars, we call “definite clause grammars” (DCGs). A DCG provides not only a description of a language, but also an effective means for analysing strings of that language, since the DCG, as it stands, is an executable program of the programming language Prolog. Using a standard Prolog compiler, the DCG can be compiled into efficient code, making it feasible to implement practical language analysers directly as DCGs. This paper compares DCGs with the successful and widely used augmented transition network (ATN) formalism, and indicates how ATNs can be translated into DCGs.

In Hayes, J. E., Michie, D., and Pao, Y.-H. (Eds.), Machine Intelligence 10. Ellis Horwood.

Proc. ACL 1-8

It appears, however, that we [in AI] are now (finally!) on the verge of practicality in a number of specialities within machine intelligence more or less simultaneously. This can be expected to result in the short term in a qualitative shift in the nature of the field itself, and to result in the longer term in a shift in the way certain industries go about their businessThis paper will discuss three specific areas of work in machine intelligence that MIC [Machine Intelligence Corporation] feels are ripe for commercial application: machine vision, naturallanguage access to computers, and expert systems. It will close with some observations on what makes these areas appropriate for application at this time, and on the difference between a technical solution to a problem and a product.In Hayes, J. E., Michie, D., and Pao, Y.-H. (Eds.), Machine Intelligence 10. Ellis Horwood.

The Yale Artificial Intelligence Project, under the direction of Professor Roger C. Schank, supports a number of research projects. Most of this research is in the02-02 area of attempting to model the processes involved in human understanding, with a current emphasis on memory models and the processes involved in learning.

This overview takes a general look at search in problem solving, indicating some connections with topics considered in other Handbook chapters. The these general ideas are found in programs for natural second section considers algorithms that use these language understanding, information retrieval, automatic representations. In methods, which use information about the nature and this chapter of the Handbook we examine search as a tool structure of the problem domain to limit the search. Most of the Finally, the chapter reviews several well-known early examples considered are problems that are relatively easy programs based on search, together with some related to formalize. The first of these is a may be, however, that the description of a task-domain database, which describes both the current task-domain situation is too large for multiple versions to be stored situation and the goal.

AI research at CMU is closely integrated with other activities in the Computer Science Department, and to a major degree with ongoing research in the Psychology Department. Although there are over 50 faculty, staff and graduate students involved in various aspects of AI research, there is no administratively (or physically) separate AI laboratory. To underscore the interdisciplinary nature of our AI research, a significant fraction of the projects listed below are joint ventures between computer science and psychology.

Reading, Mass.: Addison-Wesley

Artificial Intelligence