Not enough data to create a plot.
Try a different view from the menu above.
Country
GLISP: A Lisp-Based Programming System with Data Abstraction
GLISP is a high-level language that is complied into LISP. It provides a versatile abstract-data-type facility with hierarchical inheritance of properties and object-centered programming. GLISP programs are shorter and more readable than equivalent LISP programs. The object code produced by GLISP is optimized, making it about as efficient as handwritten Lisp. An integrated programming environment is provided, including automatic incremental compilation, interpretive programming features, and an intelligent display-based inspector/editor for data and data-type descriptions. GLISP code is relatively portable; the compiler and data inspector are implemented for most major dialects of LISP and are available free or at nominal cost.
Reviews of Books Editorial
This issue of the AI Magazine initiates a new and artistic efforts can have a real effect on our and (we hope) regular feature, Reviews of Books. Before presenting our first book review, a few comments Visions of applications of computer technology can about the aims of this feature are in order. However, we are general public. For the reasons outlined above as particularly interested in reviewing publications well as others, review and discussion of popular that attempt to provide tutorial and other forms treatments of work in AI are a useful adjunct to of summary discussions of broad areas of artificial the standard sorts of review to be included in this intelligence, publications that examine existing research column. We extend an invitation to anyone interested since one goal of the AI Magazine is to provide a in submitting a review.
Machine Learning: A Historical and Methodological Analysis
Carbonell, Jaime G., Michalski, Ryszard S., Mitchell, Tom M.
Machine learning has always been an integral part of artificial intelligence, and its methodology has evolved in concert with the major concerns of the field. In response to the difficulties of encoding ever-increasing volumes of knowledge in modern AI systems, many researchers have recently turned their attention to machine learning as a means to overcome the knowledge acquisition bottleneck. This article presents a taxonomic analysis of machine learning organized primarily by learning strategies and secondarily by knowledge representation and application areas. A historical survey outlining the development of various approaches to machine learning is presented from early neural networks to present knowledge-intensive techniques.
Artificial Intelligence: An Assessment of the State-of-the-Art and Recommendations for Future Directions
This report covers two main AI areas: natural language processing and expert systems. The discussion of each area includes an assessment of the state-of-the-art, an enumeration of problems areas and opportunities, recommendations for the next 5-10 years, and an assessment of the resources required to carry them out. A discussion of possible university-industry-government cooperative efforts is also included.
Knowledge Programming in Loops
Stefik, Mark, Bobrow, Daniel G., Mittal, Sanjay
Early this year fifty people took an experimental course at Xerox PARC on knowledge programming in Loops. During the course, they extended and debugged small knowledge systems in a simulated economics domain called Truckin. Everyone learned how to use the environment Loops, formulated the knowledge for their own program, and represented it in Loops. At the end of the course a knowledge competition was run so that the strategies used in the different systems could be compared. The punchline to this story is that almost everyone learned enough about Loops to complete a small knowledge system in only three days. Although one must exercise caution in extrapolating from small experiments, the results suggest that there is substantial power in integrating multiple programming paradigms.
The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks
Lesser, Victor R., Corkill, Daniel G.
Cooperative distributed problem solving networks are distributed networks of semi-autonomous processing nodes that work together to solve a single problem. The Distributed Vehicle Monitoring Testbed is a flexible and fully-instrumented research tool for empirically evaluating alternative designs for these networks. The testbed simulates a class of a distributed knowledge-based problem solving systems operating on an abstracted version of a vehicle monitoring task. There are two important aspects to the testbed: (1.) it implements a novel generic architecture for distributed problems solving networks that exploits the use of sophisticated local node control and meta-level control to improve global coherence in network problem solving; (2.) it serves as an example of how a testbed can be engineered to permit the empirical exploration of design issues in knowledge AI systems. The testbed is capable of simulating different degrees of sophistication in problem solving knowledge and focus-of attention mechanisms, for varying the distribution and characteristics of error in its (simulated) input data, and for measuring the progress of problem solving. Node configuration and communication channel characteristics can also be independently varied in the simulated network.
Distinguished Service Award: IJCAI 1983
The award will be presented at the Eighth International Joint Conference on Artificial Intelligence, to be held in Karlsruhe, West Germany, from 8 to 12 August, 1983. The IJCAI Distinguished Service Award was established in 1979 by the IJCAI Trustees to honor senior scientists in artificial intelligence for contributions and service to the field during their careers. The Award carries a stipend of $1,000 and covers expenses of the recipient's attendance at IJCAI. This will be the second IJCAI Distinguished Service Award; the first was presented to Bernard Meltzer in 1979. Arthur Samuel is one of the pioneeers in AI.
On the Relationship Between Strong and Weak Problem Solvers
Ernst, George W., Banerji, Ranan B.
The basic thesis put forth in this article is that a problem solver is essentially an interpreter that carries out computations implicit in the problem formulation. A good problem formulation gives rise to what is conventionally called a strong problem solver; poor formulations correspond to weak problem solvers. Knowledge-based systems are discussed in the context of this thesis. We also make observations about the relationship between search strategy and problem formulation.