An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras

Authors:
Abdelilah Kandri-Rody;Deepak Kapur;Paliath Narendran
Affiliations:
Univ. Cadi Ayyad, Marrakech, Morocco;General Electric Company, Schenectady, NY;General Electric Company, Schenectady, NY
Venue:
Proc. of the first international conference on Rewriting techniques and applications
Year:
1985

Matching, unification and complexity

ACM SIGSAM Bulletin
History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain

Journal of Symbolic Computation
Cancellativity in finitely presented semigroups

Journal of Symbolic Computation
The complexity of equivalence for commutative rings

Journal of Symbolic Computation
Completion of integral polynomials by AC-term completion

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Automating Elementary Number-Theoretic Proofs Using Gröbner Bases

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A short survey of automated reasoning

AB'07 Proceedings of the 2nd international conference on Algebraic biology
Boolean Gröbner bases

Journal of Symbolic Computation

Hi-index	0.00