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
|