Solving polynomial constraints for proving termination of rewriting

A termination problem can be transformed into a set of polynomial constraints. Up to now, several approaches have been studied to deal with these constraints as constraint solving problems. In this thesis, we study in depth some of these approaches, present some advances in each approach.Navarro Marset, RA. (2008). Solving polynomial constraints for proving termination of rewriting. http://hdl.handle.net/10251/13626Archivo delegad

Quantifier Elimination for Quartics

Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real (positive/negative) and complex root classification for polynomials. The equivalent quantifier-free formulas are obtained mainly be hand and are simpler than those obtained automatically by previous methods or QE tools. Also, applications of the results to program verification and determination of positivity of symmetric polynomials are showed.Computer Science, Artificial IntelligenceMathematics, Interdisciplinary ApplicationsSCI(E)EICPCI-S(ISTP)