The ways of using the Elliot-MacMahon algorithm to compute the Hilbert base
of a system of linear Diophantine equations known so far are either not ef
ficient or can fail to terminate. We present a version of an algorithm expl
oiting this range of ideas, which however is reasonably efficient as well a
s finite. (C) 2001 Elsevier Science B.V. All rights reserved.