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.

The Association for the Advancement of Artificial Intelligence held its 1991 Spring Symposium Series on March 26-28 at Stanford University, Stanford, California. This article contains short summaries of the eight symposia that were conducted: Argumentation and Belief, Composite System Design, Connectionist Natural Language Processing, Constraint-Based Reasoning, Implemented Knowledge Representation and Reasoning Systems, Integrated Intelligent Architectures, Logical Formalizations of Commonsense Reasoning, and Machine Learning of Natural Language and Ontology.

This article describes a task-specific, domain-independent architecture for candidate evaluation. I discuss the task-specific architecture approach to knowledge-based system development. 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.

There has been a good deal of discussion recently about the possibility of standardizing knowledge representation efforts, including the development of an interlingua, or knowledge interchange format (KIF), that would allow developers of declarative knowledge to share their results with other AI researchers. In this article, I examine the practicality of this idea. I present some philosophical arguments against it, describe a straw-man KIF, and suggest specific experiments that would help explore these issues.

In my Ph.D. dissertation (Bhansali 1991), I develop an integrated knowledge-based framework for efficiently synthesizing programs by bringing together ideas from the fields of software engineering (software reuse, domain modeling) and AI (hierarchical planning, analogical reasoning). Based on this framework, I constructed a prototype system, APU, that can synthesize UNIX shell scripts from a high-level specification of problems typically encountered by novice shell programmers. An empirical evaluation of the system's performance points to certain criteria that determine the feasibility of the derivational analogy approach in the automatic programming domain when the cost of detecting analogies and recovering from wrong analogs is considered.

Building new knowledge-based systems today usually entails constructing new knowledge bases from scratch. It could instead be done by assembling reusable components. System developers would then only need to worry about creating the specialized knowledge and reasoners new to the specific task of their system. This new system would interoperate with existing systems, using them to perform some of its reasoning. In this way, declarative knowledge, problem- solving techniques, and reasoning services could all be shared among systems. This approach would facilitate building bigger and better systems cheaply. The infrastructure to support such sharing and reuse would lead to greater ubiquity of these systems, potentially transforming the knowledge industry. This article presents a vision of the future in which knowledge-based system development and operation is facilitated by infrastructure and technology for knowledge sharing. It describes an initiative currently under way to develop these ideas and suggests steps that must be taken in the future to try to realize this vision.

There has been a good deal of discussion recently about the possibility of standardizing knowledge representation efforts, including the development of an interlingua, or knowledge interchange format (KIF), that would allow developers of declarative knowledge to share their results with other AI researchers. In this article, I examine the practicality of this idea. I present some philosophical arguments against it, describe a straw-man KIF, and suggest specific experiments that would help explore these issues.

This article argues that autonomy, not problem-solving prowess, is the key property that defines the intuitive notion of "intelligent creature." To build an intelligent artificial entity that will act autonomously, we must first understand the attributes of a system that lead us to call it autonomous. The presence of these attributes gives autonomous systems the appearance of nondeterminism, but they can all be present in deterministic artifacts and living systems. We argue that autonomy means having the right kinds of goals and the ability to select goals from an existing set, not necessarily creating new goals. We analyze the concept of goals in problem-solving systems in general and establish criteria for the types of goals that characterize autonomy.

First, the the other does. No theorist is going Thank you for the opportunity to split between the neats and scruffies to spend his or her time attempting respond to the letters by Jim Hendler, is old and institutionalized, as to bring precision to a mess of hacks, James Herbsleb and Mike Wellman Hendler points out. Few researchers kludges and "knowledge," and no regarding my survey of the Eighth are trained in both camps. Second, system builder is apt to find the National Conference on Artificial the pathologies that researchers in attempt informative. MAD does not Intelligence (AI Magazine, Volume 12, AAAI-90 themselves attributed to mean business as usual with occasional No. 1).

Each is supported and work to find a general solution to that by a formalized theory of the moves in the class of problems.