Correct answers to allowed programs and queries are ground

Abstract Cavedon and Lloyd have shown that if P is an allowed and stratified program and G an allowed goal, then all correct answers to comp( P ) ∪ { G } are ground. We show that the restriction that P be stratified can be replaced by the weaker condition that comp( P ) is consistent.