Goto

Collaborating Authors

 Industry


1992 AAAI Robot Exhibition and Competition

AI Magazine

The first Robotics Exhibition and Competition sponsored by the Association for the Advancement of Artificial Intelligence was held in San Jose, California, on 14-16 July 1992 in conjunction with the Tenth National Conference on AI. This article describes the history behind the competition, the preparations leading to the competition, the threedays during which 12 teams competed in the three events making up the competition, and the prospects for other such competitions in the future.


AAAI 1992 Fall Symposium Series Reports

AI Magazine

The Association for the Advancement of Artificial Intelligence held its 1992 Fall Symposium Series on October 23-25 at the Royal Sonesta Hotel in Cambridge, Massachusetts. This article contains summaries of the five symposia that were conducted: Applications of AI to Real-World Autonomous Mobile Robots, Design from Physical Principles, Intelligent Scientific Computation, Issues in Description Logics: Users Meet Developers, and Probabilistic Approaches to Natural Language.


What Is a Knowledge Representation?

AI Magazine

Although knowledge representation is one of the central and, in some ways, most familiar concepts in AI, the most fundamental question about it -- What is it? -- has rarely been answered directly. Numerous papers have lobbied for one or another variety of representation, other papers have argued for various properties a representation should have, and still others have focused on properties that are important to the notion of representation in general. In this article, we go back to basics to address the question directly. We believe that the answer can best be understood in terms of five important and distinctly different roles that a representation plays, each of which places different and, at times, conflicting demands on the properties a representation should have. We argue that keeping in mind all five of these roles provides a usefully broad perspective that sheds light on some longstanding disputes and can invigorate both research and practice in the field.


Applied AI News

AI Magazine

The system has reduced time The system, developed by Stereo-spent by store personnel on the telephone seeking answers to point-of-sale Graphics (San Rafael, Calif.), uses a technical problems, and it allows the help desk analysts to handle a wider range video projector equipped with a of responsibilities for the company. Viewers wear passive eye Swedish stock exchange, has developed an intelligent system to advise on how wear which allows each eye to view to deal in stocks and shares. The company's "hit rate" of dealing correctly with the appropriate image, thereby providing stocks has reportedly increased from 60% to 90%. IntelliCorp Inc. (Mountain View, Calif.), an expert system vendor, and James Inference Corp. (El Segundo, Calif.), Martin & Co. (Reston, Va.), a computer-aided software engineering (CASE) consulting a supplier of expert system development group, have launched a field test program for an object-oriented information tools, has teamed up with IDS engineering environment. The new product, called Object Management Financial Services (Minneapolis, Workbench, directly supports rapid application development, and will either Minn.) to jointly develop Macintosh generate a system immediately or draw information from currently available versions of Inference products.


1992 AAAI Robot Exhibition and Competition

AI Magazine

The first Robotics Exhibition and Competition sponsored by the Association for the Advancement of Artificial Intelligence was held in San Jose, California, on 14-16 July 1992 in conjunction with the Tenth National Conference on AI. This article describes the history behind the competition, the preparations leading to the competition, the threedays during which 12 teams competed in the three events making up the competition, and the prospects for other such competitions in the future.


EL: A formal, yet natural, comprehensive knowledge representation

Classics

We describe a comprehensive framework for narrative understanding based on Episodic Logic (EL). This situational logic was developed and implemented as a semantic representation and commonsense knowledge representation that would serve the full range of interpretive and inferential needs of general NLU. The most distinctive feature of EL is its natural language-like expressiveness. It allows for generalized quantifiers, lambda abstraction, sentence and predicate modifiers, sentence and predicate reification, intensional predicates (corresponding to wanting, believing, making, etc.), unreliable generalizations, and perhaps most importantly, explicit situational variables (denoting episodes, events, states of affairs, etc.) linked to arbitrary formulas that describe them. These allow episodes to be explicitly related in terms of part-whole, temporal and causal relations. Episodic logical form is easily computed from surface syntax and lends itself to effective inference.


Learning Problem-Solving Heuristics by Experimentation

Classics

Machine Learning: An Artificial Intelligence Approach contains tutorial overviews and research papers representative of trends in the area of machine learning as viewed from an artificial intelligence perspective. The book is organized into six parts. Part I provides an overview of machine learning and explains why machines should learn. Part II covers important issues affecting the design of learning programs-particularly programs that learn from examples. It also describes inductive learning systems.



Tight performance bounds on greedy policies based on imperfect value functions

Classics

Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the state space. In many situations significant portions of a large state space may be irrelevant to a specific goal and can be aggregated into a few, relevant, states. The U Tree algorithm generates a tree based state discretization that efficiently finds the relevant state chunks of large propositional domains. In this paper, we extend the U Tree algorithm to challenging domains with a continuous state space for which there is no initial discretization.