1971
DOI: 10.1145/362637.362648
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic simplification

Abstract: Algebraic simplification is examined first from the point of view of a user needing to comprehend a large expression, and second from the point of view of a designer who wants to construct a useful and efficient system. First we describe various techniques akin to substitution.These techniques can be used to decrease the size of an expression and make it more intelligible to a user.Then we delineate the spectrum of approaches to the design of automatic simplification capabilities in an algebraic manipulation s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

1975
1975
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 105 publications
(6 citation statements)
references
References 25 publications
0
6
0
Order By: Relevance
“…Consider, for example, the following simple program to sort an array Beyond this, there are a number of defects in the current system whose solutions are understood. The algebraic manipulation subsystem could be augmented with a radical simplification package [13]. Similarly, the methods used for solution of difference equations could be extended.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Consider, for example, the following simple program to sort an array Beyond this, there are a number of defects in the current system whose solutions are understood. The algebraic manipulation subsystem could be augmented with a radical simplification package [13]. Similarly, the methods used for solution of difference equations could be extended.…”
Section: Discussionmentioning
confidence: 99%
“…If J?,'s are present, their first and second derivatives are represented formally. The only complication is the pervasive use of algebraic simplification to control the size of the expressions [13]. Evaluating at z = 1 and using the known values of the zeroth, first, and second derivatives of the Rt's yields the desired results.…”
mentioning
confidence: 98%
“…We can attempt to set reasonable defaults, but a useful system should probably allow the user to make intelligent choices. It is very difficult to define meaningful canonical forms for general symbolic expressions, and the optimal form often depends on the application [5,19]. A classical problem is whether it makes sense to expand (π + 1) 1000 in Q(π ) or whether the result should be represented in Q((π + 1) 1000 ) (in Calcium, this is configurable).…”
Section: Choosing Extension Numbersmentioning
confidence: 99%
“…1981) and MACSYMA (Moses 1971) are invaluable to an engineer, but only provide a partial answer to automating the explanation skill, since they tell us what a device does, but not why. Thus the essential goal of work like ENVISION (de Kleer 1984;de Kleer and Brown 1984), temporal qualitative analysis (Williams 19841, qualitative process theory (Forbus 1984), and temporal constraint propagation (Roylance 1980) was causal explanation, not, as Sacks and Doyle claim, SPQR.…”
Section: "Experts Focus On Asymptotic Behavior While Spqr Focuses Onmentioning
confidence: 99%