Simplification of expressions involving radicals
Journal of Symbolic Computation
Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Computer algebra: systems and algorithms for algebraic computation
Computer algebra: systems and algorithms for algebraic computation
A computational logic handbook
A computational logic handbook
Simplification of real elementary functions
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A holonomic systems approach to special functions identities
Journal of Computational and Applied Mathematics
Algorithms for computer algebra
Algorithms for computer algebra
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Non-commmutative elimination in ore algebras proves multivariate identities
Journal of Symbolic Computation
On Canonical Forms and Simplification
Journal of the ACM (JACM)
Algebraic simplification: a guide for the perplexed
Communications of the ACM
Algorithms for trigonometric polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
An Overview of a Formal Framework for Managing Mathematics
Annals of Mathematics and Artificial Intelligence
Workshop: The Role of Automated Deduction in Mathematics
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Better simplification of elementary functions through power series
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Modern Computer Algebra
Adherence is better than adjacency: computing the Riemann index using CAD
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Parsimony principles for software components and metalanguages
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Useful computations need useful numbers
ACM Communications in Computer Algebra
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Hierarchical representations with signatures for large expression management
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Automated simplification of large symbolic expressions
Journal of Symbolic Computation
| Hi-index | 0.00 |
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 found in implementations of simplification routines.