Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2012.19A.1.069

For-loop for Logic Programming  

Kwon, Kee-Hang (동아대학교 컴퓨터공학과)
Ha, Hong-Pyo (서강대학교 컴퓨터공학과)
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 $G_1{\cap}G_2$ which is based on the game semantics of Japaridze. This paper proposes sequential iterative goal formulas of the form ${\cap}_x^LG$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. ${\cap}_x^L$ 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$.
Keywords
For-loop; Sequentiality; Iteration; Bounded Quantifier; Computability Logic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. Apt, "Arrays, bounded quantification and iteration in logic and constraint logic programming", Science of Computer Programming, Vol.26, pp.133-148, 1996.   DOI   ScienceOn
2 J. Schimpf, "Logical loops", ICLP, pp.224-238, 2002.
3 G. Japaridze, "Introduction to computability logic", Annals of Pure and Applied Logic, Vol.123, pp.1-99, 2003.   DOI   ScienceOn
4 G. Japaridze, "Sequential operators in computability logic", Information and Computation, Vol.206, No.12, pp.1443-1475, 2008.   DOI   ScienceOn
5 G. Japaridze, "A new face of the branching recurrence of computability logic", Applied Mathematics Letters (to appear).
6 K. Kwon and S. Hur, "Adding sequential conjunctions to Prolog", IJCTA, Vol.1, No.1, pp.1-3, 2010.   DOI
7 D. Miller, "A logical analysis of modules in logic programming", Journal of Logic Programming, Vol.6, pp.79-108, 1989.   DOI   ScienceOn
8 D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, "Uniform proofs as a foundation for logic programming", Annals of Pure and Applied Logic, Vol.51, pp.125-157, 1991.   DOI   ScienceOn