For-Loop for Logic Programming


The KIPS Transactions:PartA, Vol. 19, No. 1, pp. 69-72, Feb. 2012
10.3745/KIPSTA.2012.19.1.69,   PDF Download:

Abstract

Logic programming based on classical or linear logic has traditionally lacked devices for expressing sequential tasks and sequential iterative tasks. Expressing sequential goal tasks has been addressed by a recent proposal of sequential goals of the form G1 ∩ G2 which is based on the game semantics of Japaridze. This paper proposes sequential iterative goal formulas of the form ∩LXG where G is a goal, x is a variable, and L is a list. ∩LX is called a sequential bounded quantier. These goals allow us to specify the following task: sequentially iterate G with x ranging over all the elements of L.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. H. Keon and H. P. Ha, "For-Loop for Logic Programming," The KIPS Transactions:PartA, vol. 19, no. 1, pp. 69-72, 2012. DOI: 10.3745/KIPSTA.2012.19.1.69.

[ACM Style]
Kee Hang Keon and Hong Pyo Ha. 2012. For-Loop for Logic Programming. The KIPS Transactions:PartA, 19, 1, (2012), 69-72. DOI: 10.3745/KIPSTA.2012.19.1.69.