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

Dimiter Skordev

Banach Center Publications (1993)

  • Volume: 28, Issue: 1, page 151-166
  • ISSN: 0137-6934

How to cite


Skordev, Dimiter. "On the detection of some periodic loops during the execution of Prolog programs." Banach Center Publications 28.1 (1993): 151-166. <http://eudml.org/doc/262665>.

author = {Skordev, Dimiter},
journal = {Banach Center Publications},
keywords = {Prolog programs; detection method; deterministic Mazurkiewicz algorithms},
language = {eng},
number = {1},
pages = {151-166},
title = {On the detection of some periodic loops during the execution of Prolog programs},
url = {http://eudml.org/doc/262665},
volume = {28},
year = {1993},

AU - Skordev, Dimiter
TI - On the detection of some periodic loops during the execution of Prolog programs
JO - Banach Center Publications
PY - 1993
VL - 28
IS - 1
SP - 151
EP - 166
LA - eng
KW - Prolog programs; detection method; deterministic Mazurkiewicz algorithms
UR - http://eudml.org/doc/262665
ER -


  1. [1] Ph. Besnard, On infinite loops in logic programming, Rapports de Recherche 1096, IRISA, Rennes 1989. 
  2. [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. Zbl0741.68027
  3. [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. [4] M. A. Covington, Eliminating unwanted loops in logic programming, SIGPLAN Notices 20 (1) (1985), 20-26. 
  5. [5] M. A. Covington, A further note on looping in Prolog, ibid. 20 (8) (1985), 28-31. 
  6. [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). Zbl0689.68114
  7. [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. [8] D. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, second ed., Addison-Wesley, Reading, Mass., 1981. Zbl0477.65002
  9. [9] A. Mazurkiewicz, Recursive algorithms and formal languages, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 20 (1972), 799-803. Zbl0259.68033
  10. [10] D. Nute, A programming solution to certain problems with loops in Prolog, SIGPLAN Notices 20 (8) (1985), 32-37. 
  11. [11] L. Plümer, Termination proofs for logic programs, dissertation, Univ. Dortmund, 1989. Zbl0714.68089
  12. [12] D. Poole and R. Goebel, On eliminating loops in Prolog, SIGPLAN Notices 20 (8) (1985), 38-40. 
  13. [13] A. Schmücker, Analyse und Transformationen von Hornklausel-Programmen unter Verwendung von Templateketten, dissertation, Univ. Kaiserslautern, 1986. 
  14. [14] D. Skordev, An extremal problem concerning the detection of cyclic loops, C. R. Acad. Bulgare Sci. 40 (10) (1987), 5-8. Zbl0657.68009
  15. [15] D. Skordev, On the detection of periodic loops in computational processes, J. Symbolic Logic 57 (1992), 335-336. 
  16. [16] A. Van Gelder, Efficient loop detection in Prolog using the tortoise-and-hare technique, J. Logic Programming 4 (1987), 23-31. Zbl0608.68006

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.