  We give a quadratic-time explicit and computable algorithm to solve the word
problem for Artin groups that do not contain any relations of length 3.
Furthermore, we prove that, given two geodesic words representing the same
element, one can obtain one from the other by using a set of homogeneous
relations that never increase the word length.
