Preserving Termination of Tabled Logic Programs While Unfolding (1997)
Cached
Download Links
- [www.cs.kuleuven.ac.be]
- [www.stups.uni-duesseldorf.de]
- [www.stups.uni-duesseldorf.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of the 7th Int’l Workshop on Logic Programming Synthesis and Transformation (LOPSTR’97 |
| Citations: | 14 - 8 self |
BibTeX
@INPROCEEDINGS{Leuschel97preservingtermination,
author = {Michael Leuschel and Bern Martens and Konstantinos Sagonas},
title = {Preserving Termination of Tabled Logic Programs While Unfolding},
booktitle = {In Proc. of the 7th Int’l Workshop on Logic Programming Synthesis and Transformation (LOPSTR’97},
year = {1997},
pages = {189--205},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We provide a first investigation of the specialisation and transformation of tabled logic programs through unfolding. We show that --- surprisingly --- unfolding, even determinate, can worsen the termination behaviour in the context of tabling. We therefore establish two criteria which ensure that such mishaps are avoided. We also briefly discuss the influence of some other transformation techniques on the termination and efficiency of tabled logic programs.
