Title :
Preventing infinite looping in Prolog
Author_Institution :
Sch. of Inf. Technol., Univ. Coll. of Southern Queensland, Toowoomba, Qld., Australia
Abstract :
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
Keywords :
PROLOG; deductive databases; logic programming; program compilers; Prolog compilers; deductive databases; extensional boundedness; infinite looping; recursive Prolog programs; recursive query processing; uniform boundedness; Australia; Deductive databases; Educational institutions; Information technology; Logic programming; Program processors; Query processing;
Conference_Titel :
Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
0-8186-2300-4
DOI :
10.1109/TAI.1991.167044
