Bounded Loops for Prolog

Prolog have traditionally lacked de-vices for expressing the bounded-looping tasks.This limitation has been addressed by adoptinga bounded sequential recurrence goal formulas ofthe formTnG where G is a goal and n is a nat-ural number. These goals allow us to specify thelooping tasks of exactly n times.keywords: Prolog, bounded loop, com-putability logic