Preserving termination of tabled logic programs while unfolding (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1463, Issue , 1998, Pages 189-205

  Leuschel, Michael ^a   Martens, Bern ^a   Sagonas, Konstantinos ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC;

EXTENDED ABSTRACTS; LOGIC PROGRAMS; SPECIALISATION; TRANSFORMATION TECHNIQUES;

LOGIC PROGRAMMING;

EID: 84947926919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49674-2_10     Document Type: Conference Paper

References (27)

1. K. Benkerimi and P. M. Hill. Supporting Transformations for the Partial Evaluation of Logic Programs. Journal of Logic and Computation, 3(5):469-486, October 1993.
2. R. M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal of the ACM, 24(1):44-67, January 1977.
3. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20-74, January 1996.
4. M. Codish, M. Bruynooghe, M. García de la Banda, and M. Hermenegildo. Exploiting Goal Independence in the Analysis of Logic Programs. Journal of Logic Programming, 32(3):247-262, September 1997.
5. M. Codish, B. Demoen, and K. Sagonas. Semantic-Based Program Analysis for Logic-Based Languages using XSB. K.U. Leuven Technical Report CW 245. December 1996.
6. S. Decorte, D. De Schreye, M. Leuschel, B. Martens, and K. Sagonas. Termination Analysis for Tabled Logic Programming. In N. Fuchs, editor, Proceedings of LOP-STR’97: Logic Program Synthesis and Transformation, LNCS, Leuven, Belgium, July 1997. Springer-Verlag.
7. M. Falaschi, G. Levi, C. Palamidessi, and M. Martelli. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Comput. Sci., 69(3):289-318, 1989.
8. J. Gallagher. A System for Specialising Logic Programs. Technical Report TR-91-32, University of Bristol, November 1991.
9. J. Gallagher. Tutorial on Specialisation of Logic Programs. In ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98, Copenhagen, Denmark, June 1993. ACM Press.
10. J. Gallagher and M. Bruynooghe. Some Low-Level Source Transformations for Logic Programs. In M. Bruynooghe, editor, Proceedings of the Second Workshop on Meta-programming in Logic, pages 229-244, Leuven, Belgium, April 1990.
11. R. Glück, J. Jørgensen, B. Martens, and M. H. Sørensen. Controlling Conjunctive Partial Deduction of Definite Logic Programs. In H. Kuchen and S. Swierstra, editors, Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP’96), number 1140 in LNCS, pages 152-166, Aachen, Germany, September 1996. Springer-Verlag. Extended version as Technical Report CW 226, K.U. Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.
12. C. K. Holst. Finiteness Analysis. In J. Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA), number 523 in LNCS, pages 473-495. Springer-Verlag, August 1991.
13. M. Leuschel and D. De Schreye. Towards creating specialised integrity checks through partial evaluation of meta-interpreters. In Proceedings of PEPM’95, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 253-263, La Jolla, California, June 1995. ACM Press.
14. M. Leuschel, D. De Schreye, and A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP’96, pages 319-332, Bonn, Germany, September 1996. MIT Press. Extended version as Technical Report CW 225, K.U. Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.
15. M. Leuschel and B. Martens. Partial deduction of the ground representation and its application to integrity checking. In J. W. Lloyd, editor, Proceedings of ILPS’95, the International Logic Programming Symposium, pages 495-509, Portland, USA, December 1995. MIT Press. Extended version as Technical Report CW 210, K.U. Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.
16. M. Leuschel and D. Schreye. Logic program specialisation: How to be more specific. In H. Kuchen and S. Swierstra, editors, Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP’96), number 1140 in LNCS, pages 137-151, Aachen, Germany, September 1996. Springer-Verlag. Extended version as Technical Report CW 232, K.U. Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.
17. J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11(3 & 4):217-242, October/November 1991.
18. A. Pettorossi and M. Proietti. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming, 19 & 20:261-320, May/July 1994.
19. S. Prestwich. An Unfold Rule for Full Prolog. In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation: Proceedings of LOPSTR’92, Workshops in Computing, Manchester, U.K., 1992. Springer-Verlag.
20. S. Prestwich. The PADDY Partial Deduction System. Technical Report ECRC-92-6, ECRC, Munich, Germany, 1992.
21. M. Proietti and A. Pettorossi. Semantics Preserving Transformation Rules for Prolog. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 274-284, Yale University, New Haven, Connecticut, U.S.A., June 1991. ACM Press.
22. I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient Tabling Mechanisms for Logic Programs. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 687-711, Tokyo, Japan, June 1995. The MIT Press.
23. K. Sagonas. The SLG-WAM: A Search-Efficient Engine for Well-Founded Evaluation of Normal Logic Programs. PhD thesis, Department of Computer Science, SUNY at Stony Brook, August 1996.
24. K. Sagonas, T. Swift, and D. S. Warren. XSB as an Efficient Deductive Database Engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442-453, Minneapolis, Minnesota, May 1994. ACM Press.
25. D. Sahlin. Mixtus: An Automatic Partial Evaluator for Full Prolog. New Generation Computing, 12(1):7-51, 1993.
26. H. Tamaki and T. Sato. Unfold/Fold Transformations of Logic Programs. In S.- Å. Tärnlund, editor, Proceedings of the Second International Conference on Logic Programming, pages 127-138, Uppsala, Sweden, July 1984.
27. H. Tamaki and T. Sato. OLD Resolution with Tabulation. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, number 225 in LNCS, pages 84-98, London, July 1986. Springer-Verlag.