In his model, requirements needs, it must be able to represent is done unintentionally; a problem for filling system knowledge solver attempting to solve a gaps also direct explanation generation what these needs are. Ram proposed problem simply stores a trace of its by guiding retrieval and revision representations that include processing without attention to its of explanations during case-based the desired knowledge (possibly partially future relevance. However, Ng's previously explanation construction (Leake specified) and the reason that mentioned studies show that 1992). In the context of analogical the knowledge is sought. Leake for a different class of task, learning mapping, Thagard pointed out that focused on the representation of the goals have a strong effect on the goals, semantic constraints, and syntactic knowledge required to resolve anomalies learning performance of human constraints all affect analogical (which depends on a vocabulary learners. A future question is to identify mapping (Holyoak and Thagard 1989) of anomaly characterization structures the limits of goal-driven processing and the retrieval of potential analogs to describe the information in human learners.

In his recent papers, entitled Intelligence without Representation and Intelligence without Reason, Brooks argues for mobile robots as the foundation of AI research. This article argues that even if we seek to investigate complete agents in real-world environments, robotics is neither necessary nor sufficient as a basis for AI research. The article proposes real-world software environments, such as operating systems or databases, as a complementary substrate for intelligent-agent research and considers the relative advantages of software environments as test beds for AI. First, the cost, effort, and expertise necessary to develop and systematically experiment with software artifacts are relatively low. Second, software environments circumvent many thorny but peripheral research issues that are inescapable in physical environments. Brooks's mobile robots tug AI toward a bottom-up focus in which the mechanics of perception and mobility mingle inextricably with or even supersede core AI research. In contrast, the softbots (software robots) I advocate facilitate the study of classical AI problems in real-world (albeit, software) domains. For example, the UNIX softbot under development at the University of Washington has led us to investigate planning with incomplete information, interleaving planning and execution, and a host of related high-level issues.

Although the economic results of PDEC's green engineering techniques are only beginning to come in, they are nonetheless compelling. In addition, as green engineering grows in practice, the outset for the entire life cycle of new jobs in remanufacturing have been applied to a product, designing for component and recycling will be created. The consortium is currently Common Lisp. It plots a cost curve A pioneering consortium at engaged in two major development that represents the effort put into Carnegie Mellon University (CMU) is activities: (1) green indicators that are disassembly, testing, repair and using AI, combined with operations measures of environmental compatibility remanufacturing, quality assurance, research, environmental science, and (2) tools that use the green and product design changes that public policy, and other disciplines, indicators to help designers make allow for recovery. It also plots a to build tools for green engineering.

Terminological knowledge representation systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a theoretical point of view a TKRS whose capabilities go beyond the ones of presently available TKRSs. The new features studied, often required in practical applications, can be summarized in three main points. First, we consider a highly expressive terminological language, called ALCNR, including general complements of concepts, number restrictions and role conjunction. Second, we allow to express inclusion statements between general concepts, and terminological cycles as a particular case. Third, we prove the decidability of a number of desirable TKRS-deduction services (like satisfiability, subsumption and instance checking) through a sound, complete and terminating calculus for reasoning in ALCNR-knowledge bases. Our calculus extends the general technique of constraint systems. As a byproduct of the proof, we get also the result that inclusion statements in ALCNR can be simulated by terminological cycles, if descriptive semantics is adopted.

To support the goal of allowing users to record and retrieve information, this paper describes an interactive note-taking system for pen-based computers with two distinctive features. First, it actively predicts what the user is going to write. Second, it automatically constructs a custom, button-box user interface on request. The system is an example of a learning-apprentice software- agent. A machine learning component characterizes the syntax and semantics of the user's information. A performance system uses this learned information to generate completion strings and construct a user interface. Description of Online Appendix: People like to record information. Doing this on paper is initially efficient, but lacks flexibility. Recording information on a computer is less efficient but more powerful. In our new note taking softwre, the user records information directly on a computer. Behind the interface, an agent acts for the user. To help, it provides defaults and constructs a custom user interface. The demonstration is a QuickTime movie of the note taking agent in action. The file is a binhexed self-extracting archive. Macintosh utilities for binhex are available from mac.archive.umich.edu. QuickTime is available from ftp.apple.com in the dts/mac/sys.soft/quicktime.

As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses containing cut cannot be learned using an extensional evaluation method, as is done in most learning systems. On the other hand, searching a space of possible programs (instead of a space of independent clauses) is unfeasible. An alternative solution is to generate first a candidate base program which covers the positive examples, and then make it consistent by inserting cut where appropriate. The problem of learning programs with cut has not been investigated before and this seems to be a natural and reasonable approach. We generalize this scheme and investigate the difficulties that arise. Some of the major shortcomings are actually caused, in general, by the need for intensional evaluation. As a conclusion, the analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages.

PITCH EXPERT was developed to make expertise available to mill-site engineers to solve pitch problems in kraft pulp mills. These problems have been estimated to cause losses to the Canadian pulp and paper industry in excess of $80 million each year. The design of the system took into account not only the complexity of the process interactions and the need for accuracy and completeness of recommendations but also the ongoing need for training mill personnel and the requirement that the system be maintainable and expandable without the constant involvement of the developers. PITCH EXPERT is now accessible by modem, and the savings achieved through use of the system covered the development costs within six months of release.

PROSE is a knowledge-based configurator platform for telecommunications products. Its outstanding feature is a product knowledge base written in C-classIC, a frame-based knowledge representation system in the KL-ONE family of languages. It is one of the first successful products using a KL-ONE style language. Unlike previous configurator applications, the PROSE knowledge base is in a purely declarative form that provides developers with the ability to add knowledge quickly and consistently. The PROSE architecture is general and is not tied to any specific telecommunications product. As such, it is being reused to develop configurators for several different products. Finally, PROSE not only generates configurations from just a few high-level parameters, but it can also verify configurations produced manually by customers, engineers, or salespeople. The same product knowledge, encoded in C-classIC, supports both the generation and the verification of product configurations.

Remember, these are only the winners. It is reducing customers' software (KBS) vendor were touted as a natural fit for AI I think It is interesting to note that other $200,000 in personnel costs; other not. I believe it is more a sign of the AI techniques, beyond traditional benefits include increased product (downsizing) times and the need for representation and reasoning, are sales from higher customer satisfaction increased visibility for the conference. In I saw many good signs at the conference systems. In particular are multiple addition, AT&T reports increases in that applied AI is alive and uses of fuzzy logic, case-based reasoning, the quality of work produced and job healthy.

AAAI News the edge of technology now, but we'll be at the point where we can Terry Weymouth of The University of Michigan was cochair and ringmaster for the performances. Grosz, Gordon conferences carried on with quiet the robots managed to perform this McKay Professor of Computer excitement in Washington in July, reasonably well. Science at Harvard, is the new President, AAAI's Autonomous Mobile Robot The third event proved the hardest, succeeding Patrick Hayes of the Competitions drew a stream of rousing and none of the robots completed the University of Illinois. The of MIT is President-Elect. The two events drew competitors robots were asked to select four "In the last several years," Grosz and spectators.