It is fairly straighttforward to adapt standard Grobner basis techniques to such algebras, e.g. see the paper [1]. See also the paper [0] which applies such algorithms to the problem at hand.
0 Jesus Gago-Vargas; Isabel Hartillo-Hermoso; Jose Marya Ucha-Enryquez
Algorithmic Invariants for Alexander Modules. LNCS 4194, 149-154
http://www.springerlink.com/content/m704326653727425/fulltext.pdf
Abstract. Let G be a group given by generators and relations. It is possible to compute a presentation matrix of a module over a ring through Fox's differential calculus. We show how to use Grobner bases as an algorithmic tool to compare the chains of elementary ideals defined by the matrix. We apply this technique to classical examples of groups and to compute the elementary ideals of Alexander matrix of knots up to 11 crossings with the same Alexander polynomial.
1 Franz Pauer, Andreas Unterkircher.
Grobner Bases for Ideals in Laurent Polynomial Rings and their Application to Systems of Difference Equations.
AAECC 9, 271-291 (1999)
http://www.springerlink.com/content/qgbwymag351atn71/fulltext.pdf
Abstract. We develop a basic theory of Grobner bases for ideals in the algebra of Laurent polynomials (and, more generally, in its monomial subalgebras). For this we have to generalize the notion of term order. The theory is applied to systems of linear partial difference equations (with constant coefficients) on ${\mathbb Z}^n$. Furthermore, we present a method to compute the intersection of an ideal in the algebra of Laurent polynomials with the subalgebra of all polynomials.