Research by members of the Department of Computer Science at Rutgers, and by their collaborators, is organized within the Laboratory for Computer Science research(LCSR). AI and AI-related applications are the major area of research within LCSR, with about forty people-faculty, staff and graduate students-currently involved in various aspects of AI research.

The Nobel Prize in Economics was awarded to Herbert Simon in 1978. At Carnegie-Mellon University he holds the title of Professor of Computer Science and Psychology. These two facts together delineate the range and uniqueness of his contributions in creating meaningful interactions among fields that developed in isolation but that are all concerned with human decision-making and problem-solving processes. In particular, Simon has brought the insights of decision theory, organization theory (especially as it applies to the business firm), behavior modeling, cognitive psychology, and the study of artificial intelligence to bear on economic questions. This has led not only to new conceptual dimensions for theoretical constructions, but also to a new humanizing realism in economics, a way of taking into account and dealing with human behavior and interactions that lie at the root of all economic activity.

The notion of an ethical machine can be interpreted in more than one way. Perhaps the most important interpretation is a machine that can generalize from existing literature to infer one or more consistent ethical systems and can work out their consequences. An ultra-intelligent machine should be able to do this, and that is one reason for not fearing it.In Hayes, J. E., Michie, D., and Pao, Y.-H. (Eds.), Machine Intelligence 10. Ellis Horwood.

Equation Time Methods Used (I) 2200 Function Swapplng,Polysolve (2) 1905 Function Swapping,Isolation (3) 6280 Homogenization,Function Swapping, (4) I010 (5) 1350 (6) 815 (7) 3580 The numbered equations refer to given in milliseconds. Polysolve,Isolation Homogenization,Polysolve,Isolation Homogenization,Polysolve,Isolation Attraction,Collection,Isolation The following table Homogenlzation,Polysolve,Isolation those given in the introduction. Times are CPU times REFERENCES [Borning and Bundy 81] Borning, A and Bundy, A. Using matching in algebraic equation solving.

Our purpose in studying natural language understanding in conjunction with problem solving is to bring together the constraints of what formal representation can actually be obtained with the question of what knowledge is required in order to solve a wide range of problems in a semantically rich domain. We believe that these issues cannot sensibly be tackled in isolation. In practical terms we have had the benefits of an increased awareness of common problems in both areas and a realisation that some of our techniques are applicable to both the control of inference and the control of parsing. Early work on solving mathematical problems stated in natural language was done by Bobrow (STUDENT - (i]) and Chamiak (CARPS - [5]). However the rudimentary parsing and simple semantic structures used by Bobrow and Charniak are inadequate for any but the easiest problems. Our intention has been to build on B/RG Chris This work was supported by SRC grant number 94493 and an SRC research studentship for Mellish.

John Wiley and Sons, Inc. Robinson, J.A. (1965) "A Machine Oriented Logic Based on the Resolution Principle".

At the present stage of research in artificial intelligence , machines are stil l remote from achieving a level of intelligence comparable in complexity to human thought. As computer applications become more sophisticated, however, and thus more influential in human affairs , it becomes increasingly important to understand both the capabilities and limitations of machine Intelligence and its potential impact on society. To this end, the artificial intelligence field was ex­amined in a systematic manner. The study was divided into two parts : (1) Delineation of areas of artificial intelligence, and postulatio " of hypothetical prod­ucts resulting from progress in the field , and (2) A judgmental portion, which involved appli­cations and implications of the products to society . For the latter purpose, a Delphi study was conducted among experts in the artificial intelligence field to solicit their opinion concerning prototype and com­mercial dates for the products, and the possibility and desirability of their applications and implications .In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

JOINDER OF CLAIMS, COUNTERCLAIMS, AND CROSS-COMPLAINTS: SUGGESTED REVISION OF THE CALIFORNIA PROVISIONS. Research in artificial intelligence, a branch of computer science, has illuminated our capacity to use computers to model human thought processes. In this Article we will argue that the time has come for serious interdisciplinary work between lawyers and computer scientists to explore the computer's potential in law. Interdisciplinary work between the lawyer and the computer scientist has floundered on the misconceptions that each has of the other's discipline. As a result, no one has yet attempted computer programs incorporating complex techniques of legal reasoning. Even efforts in legal information retrieval have been hampered by these misconceptions. In retrieval, lawyers have viewed the computer as, at most, a storehouse from which cases and statutes might be retrieved by skillfully designed indexing systems. But the lawyer rarely looks for, or even expects, clear answers. So far, the efforts in legal retrieval have given little consideration to the possibility that computers might operate on the legal data base the way a lawyer does. Yet the work in both fields law and computer science -,suggests that the computer modeling of legal reasoning would be a fruitful area for research. In this Article we speculate about the dimensions and possible directions of this research. Under the most promising of outcomes, interdisciplinary research could lead both to a greater understanding of the legal reasoning process and to the design of machine methods for performing parts of it. The prospect of using computers to model legal reasoning processes is likely to prompt a typically lawyer-like response: So what if we understand legal reasoning or legal argument formation better? Knowing more about the ways in which lawyers search and manipulate the legal data base might lead to improving the lawyer's skill at his work. We recognize the possibility that the work of many lawyers might actually involve little use of the legal data base for argument construction or dispute resolution.

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review. This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only.

E.A. Feigenbaum and J. Feldman (Eds.). Computers and Thought. McGraw-Hill, 1963. This collection includes twenty classic papers by such pioneers as A. M. Turing and Marvin Minsky who were behind the pivotal advances in artificially simulating human thought processes with computers. All Parts are available as downloadable pdf files; most individual chapters are also available separately. COMPUTING MACHINERY AND INTELLIGENCE. A. M. Turing. CHESS-PLAYING PROGRAMS AND THE PROBLEM OF COMPLEXITY. Allen Newell, J.C. Shaw and H.A. Simon. SOME STUDIES IN MACHINE LEARNING USING THE GAME OF CHECKERS. A. L. Samuel. EMPIRICAL EXPLORATIONS WITH THE LOGIC THEORY MACHINE: A CASE STUDY IN HEURISTICS. Allen Newell J.C. Shaw and H.A. Simon. REALIZATION OF A GEOMETRY-THEOREM PROVING MACHINE. H. Gelernter. EMPIRICAL EXPLORATIONS OF THE GEOMETRY-THEOREM PROVING MACHINE. H. Gelernter, J.R. Hansen, and D. W. Loveland. SUMMARY OF A HEURISTIC LINE BALANCING PROCEDURE. Fred M. Tonge. A HEURISTIC PROGRAM THAT SOLVES SYMBOLIC INTEGRATION PROBLEMS IN FRESHMAN CALCULUS. James R. Slagle. BASEBALL: AN AUTOMATIC QUESTION ANSWERER. Green, Bert F. Jr., Alice K. Wolf, Carol Chomsky, and Kenneth Laughery. INFERENTIAL MEMORY AS THE BASIS OF MACHINES WHICH UNDERSTAND NATURAL LANGUAGE. Robert K. Lindsay. PATTERN RECOGNITION BY MACHINE. Oliver G. Selfridge and Ulric Neisser. A PATTERN-RECOGNITION PROGRAM THAT GENERATES, EVALUATES, AND ADJUSTS ITS OWN OPERATORS. Leonard Uhr and Charles Vossler. GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT. Allen Newell and H.A. Simon. THE SIMULATION OF VERBAL LEARNING BEHAVIOR. Edward A. Feigenbaum. PROGRAMMING A MODEL OF HUMAN CONCEPT FORMULATION. Earl B. Hunt and Carl I. Hovland. SIMULATION OF BEHAVIOR IN THE BINARY CHOICE EXPERIMENT Julian Feldman. A MODEL OF THE TRUST INVESTMENT PROCESS. Geoffrey P. E. Clarkson. A COMPUTER MODEL OF ELEMENTARY SOCIAL BEHAVIOR. John T. Gullahorn and Jeanne E. Gullahorn. TOWARD INTELLIGENT MACHINES. Paul Armer. STEPS TOWARD ARTIFICIAL INTELLIGENCE. Marvin Minsky. A SELECTED DESCRIPTOR-INDEXED BIBLIOGRAPHY TO THE LITERATURE ON ARTIFICIAL INTELLIGENCE. Marvin Minsky.