Recently, several papers dealing with co-inductive logic programming h
ave been proposed, dealing with pure Prolog and constraint logic programming, with and without negation.
In this paper we revisit and use, as much as possible, some fundamental results developed in the Eighties to analyze the foundations, and to clarify the possibilities but also the intrinsic theoretical limits of this programming paradigm.
