%0 Journal Article %T Bounded Loops for Prolog %A Jaehwa Sohn %A Keehang Kwon %J International Journal of Computer Technology and Applications %D 2011 %I Technopark Publications %X 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 %K com- putability logic %U http://ijcta.com/documents/volumes/vol2issue1/ijcta2011020106.pdf