Grobner basis calculation is very practical for engineering, but also theoretically, in combinatorics (e.g. to prove colorability of given graph classes) and theoretical computer science (e.g. for polynomial interpretations to prove termination of programs).