Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi...
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...
It is an essential step in decomposition algorithms for radical differential ideals to satisfy the so-called Rosenfeld property. Basically all approaches to achieve this step are ...
This paper deals with our work on interactive mathematical documents. These documents accomodate various sources, users, and mathematical services. Communication of mathematics bet...
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...