DocumentCode :
2315676
Title :
Superfluous S-polynomials in Strategy-Independent Groebner Bases
Author :
Passmore, Grant Olney ; De Moura, Leonardo
Author_Institution :
LFCS, Univ. of Edinburgh, Edinburgh, UK
fYear :
2009
fDate :
26-29 Sept. 2009
Firstpage :
45
Lastpage :
53
Abstract :
Using the machinery of proof orders originally introduced by Bachmair and Dershowitz in the context of canonical equational proofs, we give an abstract, strategy-independent presentation of Groebner basis procedures and prove the correctness of two classical criteria for recognising superfluous S-polynomials, Buchberger´s criteria 1 and 2, w.r.t. arbitrary fair and correct basis construction strategies. To do so, we develop a general method for proving the strategy-independent correctness of superfluous S-polynomial criteria which seems to be quite powerful. We also derive a new superfluous S-polynomial criterion which is a generalisation of Buchberger-1 and is proved to be correct strategy-independently.
Keywords :
polynomials; theorem proving; canonical equational proofs; proof orders; strategy-independent Groebner basis procedures; strategy-independent correctness; superfluous S-polynomial criteria; superfluous S-polynomials; Algebra; Commutation; Crystallization; Equations; Inference algorithms; Machinery; Polynomials; Quantum computing; Scientific computing; Sufficient conditions; Groebner bases; S-polynomials; algorithmic commutative algebra; ideal theory; reduction to zero; rewriting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2009 11th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4244-5910-0
Electronic_ISBN :
978-1-4244-5911-7
Type :
conf
DOI :
10.1109/SYNASC.2009.59
Filename :
5460870
Link To Document :
بازگشت