Oancea, Cosmin; So, Clare; Watt, Stephen M. Generalization in Maple. (English) Zbl 1114.68629 Kotsireas, Ilias S. (ed.), Maple conference 2005. Proceedings of the conference, Waterloo Ontario, Canada, July 17–21, 2005.With the assistance of Ian J. Sinclair, James Duketow, Robert M. Kalbfleisch. Waterloo: Maplesoft (ISBN 1-894511-85-9/pbk). 377-382 (2005). Summary: 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.For the entire collection see [Zbl 1099.65002]. Cited in 2 Documents MSC: 68W30 Symbolic computation and algebraic computation Keywords:antiunification; pattern matching; computer algebra Software:Maple PDFBibTeX XMLCite \textit{C. Oancea} et al., in: Maple conference 2005. Proceedings of the conference, Waterloo Ontario, Canada, July 17--21, 2005. With the assistance of Ian J. Sinclair, James Duketow, Robert M. Kalbfleisch. Waterloo: Maplesoft. 377--382 (2005; Zbl 1114.68629)