A sufficient and necessary condition is given under which least Herbrand models exactlycharacterize the answers of definite clause programs.