Michael Leuschel, Bern Martens, Konstantinos Sagonas  Home/Search
Context Related
| cs.kuleuven.ac.be/~dtai/p...17730.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/...1998E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Context of citations to this paper: More
...techniques, originally developed for standard logic programming, to the context of tabled logic programming. In a companion paper [12], we describe how left propagation of bindings in a program executed under SLG resolution [4] using a fixed left to right computation...
.... the memoise p predicates as: memoise p(X) copy term(X,Y ) generalise(Y ,Z) p(Z) and then generalise such that quasi termination [21] of the program, where calls to p are tabulated, can be proven. In practice, the built in copy term 2 and the built ins needed to...
Cited by: More
A Memoizing Semantics for - Functional Logic Languages (Correct)
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
Termination Proofs for Logic Programs with Tabling - Verbaeten, Sagonas, De Schreye (2001) (Correct)
Active bibliography (related documents): More All
0.4: Efficient Specialisation in Prolog Using a Hand-Written.. - Leuschel, Jørgensen (1999) (Correct)
0.4: Creating Specialised Integrity Checks Through Partial.. - Leuschel, De Schreye (1998) (Correct)
0.3: Partial Evaluation of the "Real Thing" - Leuschel (1994) (Correct)
Similar documents based on text: More All
1.3: Extending Partial Deduction to Tabled Execution: Some.. - Sagonas, Leuschel (1998) (Correct)
1.3: Termination Analysis for Tabled Logic Programming - Decorte, De Schreye.. (1997) (Correct)
1.2: Memory Management for Prolog with Tabling - Demoen (1998) (Correct)
Related documents from co-citation: More All
7: Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren - 1996
6: Finiteness analysis (context) - Holst - 1991
6: OLDT-based abstract interpretation (context) - Kanamori, Kawamura - 1993
BibTeX entry: (Update)
M. Leuschel, B. Martens, and K. Sagonas. Preserving termination of tabled logic programs while unfolding. In Proceedings of LOPSTR'97: Logic Program Synthesis and Transformation, Leuven, Belgium, july 1997. http://citeseer.ist.psu.edu/leuschel97preserving.html More
@article{ leuschel98preserving,
author = "Michael Leuschel and Bern Martens and Konstantinos Sagonas",
title = "Preserving Termination of Tabled Logic Programs While Unfolding",
journal = "Lecture Notes in Computer Science",
volume = "1463",
pages = "189+",
year = "1998",
url = "citeseer.ist.psu.edu/leuschel97preserving.html" }
Citations (may not include all citations):385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
142 Tabled evaluation with delaying for general logic programs - Chen, Warren - 1996
129 Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1994
128 Declarative Modeling of the Operational Behavior of Logic La.. (context) - Falaschi, Levi et al. - 1989
112 XSB as an efficient deductive database engine - Sagonas, Swift et al. - 1994
112 OLD Resolution with Tabulation (context) - Tamaki, Sato - 1986
82 Tutorial on specialisation of logic programs (context) - Gallagher - 1993
62 Unfoldfold transformation logic program (context) - Sato, transformations et al. - 1984
46 Mixtus: An automatic partial evaluator for full Prolog (context) - Sahlin - 1993
30 A system for specialising logic programs - Gallagher - 1991
23 Finiteness Analysis (context) - Holst - 1991
23 Semantics preserving transformation rules for Prolog (context) - Proietti, Pettorossi - 1991
20 Efficient Tabling Mechanisms for Logic Programs - Ramakrishnan, Rao et al. - 1995
19 Supporting transformations for the partial evaluation of log.. (context) - Benkerimi, Hill - 1993
16 Partial deduction of the ground representation and its appli.. - Leuschel, Martens - 1995
13 The PADDY partial deduction system - Prestwich - 1992
12 An unfold rule for full Prolog (context) - Prestwich - 1992
12 Termination Analysis for Tabled Logic Programming - Decorte, De Schreye et al. - 1997
12 Towards creating specialised integrity checks through partia.. - Leuschel, De Schreye - 1995
10 Some low-level transformations for logic programs (context) - Gallagher, Bruynooghe - 1990
9 Exploiting Goal Independence in the Analysis of Logic Progra.. - Codish, Bruynooghe et al. - 1997
6 The SLG-WAM: A Search-Efficient Engine for Well-Founded Eval.. (context) - Sagonas - 1996
1 General Purpose Semantic Based Program Analysis using XSB (context) - Codish, Demoen et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/1998-E.shtml): More
Creating Specialised Integrity Checks Through Partial.. - Leuschel, De Schreye (1998) (Correct)
Semantics-Based Program Analysis for Logic-Based Languages .. - Codish, Demoen, Sagonas (1998) (Correct)
Detecting Unsolvable Queries for Definite Logic Programs - Bruynooghe.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC