Preventing infinite looping in Prolog

A method is proposed to modify Prolog compilers so that infinite looping can often be avoided in recursive Prolog programs. The study is carried out in the context of deductive databases. Termination of recursive query processing here is related to boundedness: uniform boundedness and extensional boundedness. Limitations of this method are briefly discussed.<
>