213 research outputs found
Macsyma: A personal history
AbstractThe Macsyma system arose out of research on mathematical software in the AI group at MIT in the 1960s. Algorithm development in symbolic integration and simplification arose out of the interest of people, such as the author, who were also mathematics students. The later development of algorithms for the GCD of sparse polynomials, for example, arose out of the needs of our user community. During various times in the 1970s the computer on which Macsyma ran was one of the most popular nodes on the ARPANET. We discuss the attempts in the late 70s and the 80s to develop Macsyma systems that ran on popular computer architectures. Finally, we discuss the impact of the fundamental ideas in Macsyma on the author’s current research on large scale engineering and socio-technical systems
The Use of Dependency Relationships in the Control of Reasoning
Research reported herein was conducted at the Artificial Intelligence Laboratory, a Massachusetts Institute of Technology research program supported in part by the Advanced Research Projects Agency of the Department of Defense and monitored by the Office of Naval Research under contract N00014-75-C-0643.Several recent problem-solving programs have indicated improved methods for controlling program actions. Some of these methods operate by analyzing the time-independent antecedent-consequent dependency relationships between the components of knowledge about the problem for solution. This paper is a revised version of a thesis proposal which indicates how a general system of automatically maintained dependency relationships can be used to effect many forms of control on reasoning in an antecedent reasoning framework.MIT Artificial Intelligence Laboratory
Department of Defense Advanced Research Projects Agenc
The logic theory machine as a theory of human problem-solving
In 1956 A. Newell and H.A. Simon (with the aid of J.C. Shaw) published the first paper on the Logic Theory Machine (L.T.). In effect, L.T. was a computer program that proved theorems in propositional logic
SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper)
International audienceSymbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC 2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC 2 community
An overview of artificial intelligence and robotics. Volume 1: Artificial intelligence. Part A: The core ingredients
Artificial Intelligence (AI) is an emerging technology that has recently attracted considerable attention. Many applications are now under development. The goal of Artificial Intelligence is focused on developing computational approaches to intelligent behavior. This goal is so broad - covering virtually all aspects of human cognitive activity - that substantial confusion has arisen as to the actual nature of AI, its current status and its future capability. This volume, the first in a series of NBS/NASA reports on the subject, attempts to address these concerns. Thus, this report endeavors to clarify what AI is, the foundations on which it rests, the techniques utilized, applications, the participants and, finally, AI's state-of-the-art and future trends. It is anticipated that this report will prove useful to government and private engineering and research managers, potential users, and others who will be affected by this field as it unfolds
Recommended from our members
Computer algebra techniques in object-oriented mathematical modelling.
This thesis proposes a rigorous object-oriented methodology, supported by computer algebra software, to generate and relate features in a mathematical model. Evidence shows that there is little heuristic or theoretical research into this problem from any of the three principal modelling methodologies: 'case study’, ‘scenario’ and ‘generic’. This thesis comprises two other major strands: applications of computer algebra software and the efficacy of symbolic computation in teaching and learning. Developing the principal algorithms in computer algebra has sometimes been done at the expense of ease of use. Developers have also not concentrated on integrating an algebra engine into other software. A thorough review of quantitative studies in teaching and learning mathematics highlights a serious difficulty in measuring the effect of using computer algebra. This arises because of the disparate nature of learning with and without a computer.
This research tackles relationship formulation by casting the problem domain into object-oriented terms and building an appropriate class hierarchy. This capitalises on the fact that specific problems are instances of generic problems involving prototype physical objects. The computer algebra facilitates calculus operations and algebraic manipulation. In conjunction, I develop an object-oriented design methodology applicable to small-scale mathematical modelling. An object model modifies the generic modelling cycle. This allows relationships between features in the mathematical model to be generated automatically. The software is validated by quantifying the benefits of using the object-oriented techniques, and the results are statistically significant.
The principal problem domain considered is Newtonian particle mechanics. Although the Newtonian axioms form a firm basis for a mathematical description of interactions between physical objects, applying them within a particular modelling context can cause problems. The goal is to produce an equation of motion. Applications to other contexts are also demonstrated.
This research is significant because it formalises feature and equation-generation in a novel way. A new modelling methodology ensures that this crucial stage in the modelling cycle is given priority and automated
- …