Results 221 to 230 of about 49,972 (258)

The MACSYMA system for formula manipulation

ACM SIGAPL APL Quote Quad, 1979
MACSYMA is a large LISP system which performs symbolic manipulations such as differentiation, simplification, integration and solution of equations with parametric coefficients. After exhibiting various examples of the system, we shall present some of the data representations used by MACSYMA to model abstract algebraic structures such as polynomial ...
openaire   +1 more source

Solving problems by formula manipulation in logic and linear inequalities [PDF]

Artificial Intelligence, 1972
Using formal logic, many problems from the general area of linear inequalities can be expressed in the elementary theory of addition on the real numbers (EAR). We describe a method for eliminating quantifiers in EAR which has been programmed and demonstrate its usefulness in solving some problems related to linear programming.
openaire   +1 more source

Symbolic and algebraic manipulation for formulae of interpolation and quadrature

Proceedings of the international symposium on Symbolic and algebraic computation, 1990
Computer Algebra has been used for construction and analysis of algorithms of numerical computation. In this paper, an attempt has been made to derive the formulae of interpolation and quadrature with Computer Algebra. In REDUCE language, the formula manipulation system for interpretation INTEP and for quadrature QUADRAT are developed.
openaire   +1 more source

Computer‐aided manipulation of mason's formula and its applications

International Journal of Circuit Theory and Applications, 1992
AbstractThis paper presents a new method to determine the symbolic gain of a linear system via Mason's formula. A combined searching algorithm based on the breadth‐first and depth‐first searching algorithms in a directed graph is devised to find the forward paths and loops in the linear system.
openaire   +1 more source

Hashing LEMMAs on time complexities with applications to formula manipulation

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
In this paper, time complexities of operation on “sets” and “ordered n-tuples” based on a hashing table search technique are presented as “Hashing LEMMAs” and are applied to formula manipulation. Unique normal forms for multivariate symbolic formulas resulting in O(1) time complexity for identity checks are presented.
Eiichi Goto, Yasumasa Kanada
openaire   +1 more source

Practical formula manipulation for theoretical chemistry

ACM SIGSAM Bulletin, 1971
It is not always easy to give a paper on the applications of certain computing techniques to a highly specialized branch of science. On the other hand, theoretical chemistry is already one of the biggest "customers" of numerical computing in science and offers a wide potential of nonnumerical problems to be solved as well. Being an independent software
openaire   +1 more source

The Ackermann function. a theoretical, computational, and formula manipulative study

BIT, 1971
Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other argument defines the member of the class. The first members are expressed with elementary functions, the higher members with a hierarchy of primitive recursive functions.
openaire   +1 more source

Formula manipulation in ALGOL 68 and application to Routh's algorithm

Computing, 1981
This paper presents an implementation of Routh's algorithm and the Schur criterion, in order to determine the location of the zeros of a complex polynomial in one variable, over the ring of multivariate polynomials with integral coefficients. Both algorithms are applied to the characteristic polynomials of multistep methods.
openaire   +1 more source

Robotic manipulators and the product of exponentials formula

2005
The manipulation of rigid bodies by manipulators which are motor driven kinematic chains is a fundamental aspect of robotics. In this paper, we discuss the kinematics of such processes and discuss the classification of kinematic chains using ideas from algebra and group theory. Earlier work on the role of Lie groups in mechanisms is contained in Herve [
openaire   +1 more source

Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas

International Joint Conference on Autonomous Agents and Multiagent Systems, 2019
Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. It is open to manipulative attacks such as Manipulation where judges cast their judgments strategically. Previous works have shown that most computational problems corresponding to these manipulative attacks are \NP ...
Robert Bredereck, Junjie Luo 0001
openaire   +2 more sources