Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation 2004
DOI: 10.1145/1005285.1005298
|View full text |Cite
|
Sign up to set email alerts
|

Understanding expression simplification

Abstract: We give the first formal definition of the concept of simplification for general expressions in the context of Computer Algebra Systems. The main mathematical tool is an adaptation of the theory of Minimum Description Length, which is closely related to various theories of complexity, such as Kolmogorov Complexity and Algorithmic Information Theory. In particular, we show how this theory can justify the use of various "magic constants" for deciding between some equivalent representations of an expression, as f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2006
2006
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(26 citation statements)
references
References 22 publications
0
26
0
Order By: Relevance
“…The paper (Carette, 2004) provides a formal description of simplification. The author discusses, using ideas including Kologorov complexity and minimum description length, a method for defining whether a version of an expression is more simple than another.…”
Section: Simplification In the Literaturementioning
confidence: 99%
See 2 more Smart Citations
“…The paper (Carette, 2004) provides a formal description of simplification. The author discusses, using ideas including Kologorov complexity and minimum description length, a method for defining whether a version of an expression is more simple than another.…”
Section: Simplification In the Literaturementioning
confidence: 99%
“…Searching for methods of simplification reveals many older papers as mentioned in (Carette, 2004). The papers (Buchberger and Loos, 1982;Casas et al, 1990;Caviness, 1970;Fateman, 1972;Fitch, 1973;Moses, 1971) explore formalism and technique for simplification.…”
Section: Simplification In the Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…This is an idea of J. Carette [28] to the effect that solutions at algebraic end-points and algebraic initial points for holonomic ODEs-i.e., differential-equation systems with integer-polynomial coefficients-could be considered closed. One might say diffeoclosed.…”
Section: It Turns Out That For Any Rationals R Smentioning
confidence: 99%
“…For b) in the example, the standard answer is 5 2 , while the teacher may treat it as totally correct when students enter 5 2 , 2.5, 1 1 2 as the answer. But if a student answer is 10 4 , 1 4 + 9 4 , 3 − 0.5, 5x x+x , or 00002.5000, the teacher will argue that the answer is not completely correct and will give a score of 80% or 70%.…”
Section: B Answer Grade Rulementioning
confidence: 99%