On the detection of some periodic loops during the execution of Prolog programs

• Autorzy: Dimiter Skordev
• Języki publikacji: EN
• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Banach Center Publications
• Rocznik: 1993
• Tom: 28
• Numer: 1
• Strony: 151-166

Daty

wydano

1993

Twórcy

autor

Dimiter Skordev

• Department of Mathematics, Sofia University, Blvd. J. Bourchier 5, 1126 Sofia, Bulgaria

Bibliografia

• [1] Ph. Besnard, On infinite loops in logic programming, Rapports de Recherche 1096, IRISA, Rennes 1989.
• [2] R. N. Bol, K. R. Apt and J. W. Klop, An analysis of loop checking mechanisms for logic programs, technical report, Centre for Mathematics and Computer Science, Amsterdam 1989.
• [3] D. R. Brough and A. Walker, Some practical properties of logic programming interpreters, in: Internat. Conf. on Fifth Generation Computer Systems, Institute for New Generation Computing, Tokyo 1984, 149-156.
• [4] M. A. Covington, Eliminating unwanted loops in logic programming, SIGPLAN Notices 20 (1) (1985), 20-26.
• [5] M. A. Covington, A further note on looping in Prolog, ibid. 20 (8) (1985), 28-31.
• [6] D. de Schreye, M. Bruynooghe and K. Verschaetse, On the existence of nonterminating queries for a restricted class of Prolog clauses, Artificial Intelligence 41 (1989/90).
• [7] H. Kleine Büning, U. Löwen and S. Schmitgen, Loop detection in propositional Prolog programs, in: CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, October 3-7, 1988, E. Börger, H. Kleine Büning and M. M. Richter (eds.), Lecture Notes in Comput. Sci. 385, Springer, 1989, 148-165.
• [8] D. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, second ed., Addison-Wesley, Reading, Mass., 1981.
• [9] A. Mazurkiewicz, Recursive algorithms and formal languages, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 20 (1972), 799-803.
• [10] D. Nute, A programming solution to certain problems with loops in Prolog, SIGPLAN Notices 20 (8) (1985), 32-37.
• [11] L. Plümer, Termination proofs for logic programs, dissertation, Univ. Dortmund, 1989.
• [12] D. Poole and R. Goebel, On eliminating loops in Prolog, SIGPLAN Notices 20 (8) (1985), 38-40.
• [13] A. Schmücker, Analyse und Transformationen von Hornklausel-Programmen unter Verwendung von Templateketten, dissertation, Univ. Kaiserslautern, 1986.
• [14] D. Skordev, An extremal problem concerning the detection of cyclic loops, C. R. Acad. Bulgare Sci. 40 (10) (1987), 5-8.
• [15] D. Skordev, On the detection of periodic loops in computational processes, J. Symbolic Logic 57 (1992), 335-336.
• [16] A. Van Gelder, Efficient loop detection in Prolog using the tortoise-and-hare technique, J. Logic Programming 4 (1987), 23-31.