  A sufficient and necessary condition is given under which least Herbrand
models exactly characterize the answers of definite clause programs.
  To appear in Theory and Practice of Logic Programming (TPLP).
