My Ph.D. thesis (Ward 1992, 1991)1 addressed the task of generating natural language utterances. It was motivated by two difficulties in scaling up existing generators. Current generators only accept input that are relatively poor in information, such as feature structures or lists of propositions; they are unable to deal with input rich in information, as one might expect from, for example, an expert system with a complete model of its domain or a natural language understander with good inference ability. Current generators also have a very restricted knowledge of language -- indeed, they succeed largely because they have few syntactic or lexical options available (McDonald 1987) -- and they are unable to cope with more knowledge because they deal with interactions among the various possible choices only as special cases. To address these and other issues, I built a system called FIG (flexible incremental generator). FIG is based on a single associative network that encodes lexical knowledge, syntactic knowledge, and world knowledge. Computation is done by spreading activation across the network, supplemented with a small amount of symbolic processing. Thus, FIG is a spreading activation or structured connectionist system (Feldman et al. 1988).

Feedback connections are required so that the teacher signal on the output neurons can modify weights during supervised learning. Relaxation methods are needed for learning static patterns with full-time feedback connections. Feedback network learning techniques have not achieved wide popularity because of the still greater computational efficiency of back-propagation. We show by simulation that relaxation networks of the kind we are implementing in VLSI are capable of learning large problems just like back-propagation networks. A microchip incorporates deterministic mean-field theory learning as well as stochastic Boltzmann learning. A multiple-chip electronic system implementing these networks will make high-speed parallel learning in them feasible in the future.

Feedback connections are required so that the teacher signal on the output neurons can modify weights during supervised learning. Relaxation methods are needed for learning static patterns with full-time feedback connections. Feedback network learning techniques have not achieved wide popularity because of the still greater computational efficiency of back-propagation. We show by simulation that relaxation networks of the kind we are implementing in VLSI are capable of learning large problems just like back-propagation networks. A microchip incorporates deterministic mean-field theory learning as well as stochastic Boltzmann learning. A multiple-chip electronic system implementing these networks will make high-speed parallel learning in them feasible in the future.

Feedback connections are required so that the teacher signal on the output neurons can modify weights during supervised learning. Relaxation methods are needed for learning static patterns with full-time feedback connections. Feedback network learning techniques have not achieved wide popularity because of the still greater computational efficiency of back-propagation. We show by simulation that relaxation networks of the kind we are implementing in VLSI are capable of learning large problems just like back-propagation networks. A microchip incorporates deterministic mean-field theory learning as well as stochastic Boltzmann learning. A multiple-chip electronic system implementing these networks will make high-speed parallel learning in them feasible in the future.

All inquiries should include your travel support for students who are registration area. Now Exempt from applicants must have fulfilled your lab's research efforts to be the volunteer and reporting requirements California Sales Tax shown to a large portion of the AI for previous awards. This year, Recent California legislation required community. California that can be run in parallel on several who submit a letter of recommendation Senate Bill 89 (Chapter 461, screens. Please do not send tapes of a from a faculty supervisor in lieu Statutes of 1991)-signed by the governor particular project or lecture but, of a paper, student authors from foreign at press time-provides AAAI rather, tapes that present broad institutions, and foreign scholars.

I survey four viewpoints about what AI is. I describe a program exhibiting AI as one that can change as a result of interactions with the user. Such a program would have to process hundreds or thousands of examples as opposed to a handful. Because AI is a machine's attempt to explain the behavior of the (human) system it is trying to model, the ability of a program design to scale up is critical. Researchers need to face the complexities of scaling up to programs that actually serve a purpose. The move from toy domains into concrete ones has three big consequences for the development of AI. First, it will force software designers to face the idiosyncrasies of its users. Second, it will act as an important reality check between the language of the machine, the software, and the user. Third, the scaled-up programs will become templates for future work. For a variety of reasons, some of which I discuss one of the following four things: (1) AI means in this article, the newly formed Institute magic bullets, (2) AI means inference engines, for the Learning Sciences has been concentrating (3) AI means getting a machine to do something its efforts on building high-quality you didn't think a machine could do educational software for use in business and (the "gee whiz" view), and (4) AI means elementary and secondary schools. In the two having a machine learn.

Task-specific architectures are a growing area of expert system research. Evaluation is one task that is required in many problem-solving domains. This article describes a task-specific, domain-independent architecture for candidate evaluation. I discuss the task-specific architecture approach to knowledge-based system development. Next, I present a review of candidate evaluation methods that have been used in AI and psychological modeling, focusing on the distinction between discrete truth table approaches and continuous linear models. Finally, I describe a task-specific expert system shell, which includes a development environment (Ceved) and a run-time consultation environment (Ceval). This shell enables nonprogramming domain experts to easily encode and represent evaluation-type knowledge and incorporates the encoded knowledge in performance systems.

Intelligence (AAAI) hopes that these This year's conference featured a new A talk united by a set of related research This year's program represented an by Jim Green0 addressed modeling issues. Constraint this approach is not seen There was time to interact Reasoning and Component Technologies as often today. Where is it session following each set of presentations. Highlights from the program focused on a presentation on among the accepted papers. A panel entitled "How Long which ran for two consecutive days Until the Household Robot: The For the first time, Innovative Applications during the conference. The emergence State of the Art in Robotics" featured in Artificial Intelligence (IAAI) of the forum Planning, Perception, speakers from industry and Carnegie presentations and AI Online interactive and Robotics reflected a recent trend Mellon's Robotic Institute, who panels were presented concurrently in Planning, with videotapes and a live robot providing an impressive demonstration Perception, and Robotics included demonstration.

A memorial tribute to AI researcher Jonathan King who died of cancer in 1991.

AI research is conducted at a number of academic and research units at the Georgia Institute of Technology. Some of this research is basic in nature, and some has an applied character to it. This article briefly describes basic AI research in the College of Computing at Georgia Tech.