Loop checks for logic programs with functions

Theoretical Computer Science

Volumn 266, Issue 1-2, 2001, Pages 441-461

  Shen, Yi Dong ^a,b   Yuan, Li Yan ^b   You, Jia Huai ^b  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Logic programming; Loop checking

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER OPERATING SYSTEMS; HEURISTIC METHODS;

LOOP CHECKING;

LOGIC PROGRAMMING;

EID: 0035817897     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00197-3     Document Type: Article

References (28)

1. Towards more efficient loop checks
2. Loop checking in partial deduction
3. An analysis of loop checking mechanisms for logic programs
4. Tabulated resolution for the well-founded semantics
5. Tabled evaluation with delaying for general logic programs
6. Eliminating unwanted loops in Prolog
7. A further note on loops in Prolog
8. Termination of logic programs: The never-ending story
9. Redundancy elimination and loop checks for logic programs
10. Partial evaluation in logic programming
11. On eliminating loops in Prolog
12. The mixtus approach to automatic partial evaluation of full Prolog
13. Mixtus: An automatic partial evaluator for full Prolog
14. Verifying local stratifiability of logic programs and databases II
15. An extended variant of atoms loop check for positive logic programs
16. Linear tabulated resolution for the well founded semantics
17. Linear tabulated resolution based on Prolog control strategy
18. An abstract approach to some loop detection problems
19. Controlling recursive inference
20. OLD resolution with tabulation
21. Efficient loop detection in Prolog
22. Recursive query processing: The power of logic
23. Memoing for logic programs
24. A general criterion for avoiding infinite unfolding during partial deduction
25. Automatic finite unfolding using well-founded measures
26. Sound and complete partial deduction with unfolding based on well-founded measures