Generalization in maple

TY - GEN

T1 - Generalization in maple

AU - Oancea, Cosmin Eugen

AU - So, Clare

AU - Watt, Stephen M.

N1 - @article{oancea2005generalization, title={Generalization in maple}, author={Oancea, Cosmin and So, Clare and Watt, Stephen M}, publisher={Citeseer}, booktitle = {Maple Conference}, year = 2005, pages = {277-382}, location = {Waterloo, Canada} }

PY - 2005

Y1 - 2005

N2 - We explore the notion of generalization in the setting of symbolic mathematical computing. By "generalization" we mean the process of taking a number of instances of mathematical expressions and producing new expressions that may be specialized to all the instances. We first identify a number of ways in which generalization may be useful in the setting of computer algebra, and formalize this generalization as an antiunification problem. We present a single-pass algorithm for antiunification and give some examples.

AB - We explore the notion of generalization in the setting of symbolic mathematical computing. By "generalization" we mean the process of taking a number of instances of mathematical expressions and producing new expressions that may be specialized to all the instances. We first identify a number of ways in which generalization may be useful in the setting of computer algebra, and formalize this generalization as an antiunification problem. We present a single-pass algorithm for antiunification and give some examples.

M3 - Article in proceedings

SP - 277

EP - 382

BT - Maple Conference

ER -