Completions of perpetual logic programs

AbstractFor logic programs that compute infinite atoms, SLD-resolution is not complete with respect to a natural Herbrand based semantics. The paper discusses two aspects of this problem: Characterize those programs that are complete (i.e. for which SLD-resolution is complete); if a program is not complete, then construct a complete extension of the program so that the two programs have the same finite and infinite semantics. Partial results are obtained for both problems