Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas  Home/Search
Context Related
| cs.kuleuven.ac.be/~dtai/p...18094.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 theoretical basis for studying the termination of tabled logic programs executed under SLG-resolution using a left-to-right computation rule. To this end, we study the classes of quasi-terminating and LG-terminating programs (for a set of atomic goals S). These are tabled logic programs where execution of each call from S leads to only a finite number of different (i.e., non-variant) calls, and a finite number of different calls and computed answer substitutions for them,... (Update)
Context of citations to this paper: More
...or termination. However, for tabled logic programs and mixed tabled non tabled logic programs only few automated techniques exist [13, 49]. Any logic program which terminates under the traditional logic programming semantics, trivially terminates under the tabled semantics....
.... time analysis is mentioned as an important issue in [10] The notion of quasi termination for logic programs has also been explored [6] in the context of termination analysis of tabled logic programs. In [3] it is noted that global termination of the process is ensured if...
Cited by: More
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
Preserving Termination of Tabled Logic Programs While.. - Leuschel, Martens, Sagonas (1997) (Correct)
Similar documents (at the sentence level):
8.0%: Termination Analysis of Tabled Logic Programs Using Mode.. - Verbaeten, De Schreye (1999) (Correct)
5.1%: Modular Termination Proofs for Prolog with Tabling - Verbaeten, Sagonas, De Schreye (1999) (Correct)
Active bibliography (related documents): More All
0.5: Automated Modular Termination Proofs for Real Prolog Programs - Müller, Glaß, Stroetmann (1996) (Correct)
0.4: Termination Proofs for Logic Programs with Tabling - Verbaeten, Sagonas, De Schreye (2001) (Correct)
0.3: Termination of Simply-Moded Well-Typed Logic Programs.. - Verbaeten, De Schreye (2001) (Correct)
Similar documents based on text: More All
0.4: Constraint-Based Termination Proofs for Prolog with Tabling - Verbaeten, De Schreye (Correct)
0.4: Some Achievements and Prospects in Partial Deduction - Leuschel, Martens, De Schreye (1998) (Correct)
0.4: Termination Analysis of Tabled Logic Programs using Mode.. - Verbaeten, De Schreye (1999) (Correct)
Related documents from co-citation: More All
9: Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren - 1996
9: Finiteness analysis (context) - Holst - 1991
8: OLD resolution with tabulation (context) - Tamaki, Sato - 1986
BibTeX entry: (Update)
Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, and Konstantinos Sagonas. Termination Analysis for Tabled Logic Programming. In Norbert Fuchs, editor, Proceedings of LOPSTR'97: Logic Program Synthesis and Transformation, number 1463 in LNCS, pages 107--123, Leuven, Belgium, 1997. Springer-Verlag. http://citeseer.ist.psu.edu/decorte97termination.html More
@article{ decorte98termination,
author = "Stefaan Decorte and Danny De Schreye and Michael Leuschel and Bern Martens and Konstantinos Sagonas",
title = "Termination Analysis for Tabled Logic Programming",
journal = "Lecture Notes in Computer Science",
volume = "1463",
pages = "111+",
year = "1998",
url = "citeseer.ist.psu.edu/decorte97termination.html" }
Citations (may not include all citations):142 Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren - 1996
116 Reasoning about Termination of Pure Prolog Programs - Apt, Pedreschi - 1993
112 XSB as an Efficient Deductive Database Engine - Sagonas, Swift et al. - 1994
112 OLD Resolution with Tabulation (context) - Tamaki, Sato - 1986
61 Termination of Logic Programs: The never-ending story (context) - De Schreye, Decorte - 1994
42 Termination Proofs for Logic Programs (context) - Plumer - 1990
33 Norms on Terms and their use in Proving Universal Terminatio.. (context) - Bossi, Cocco et al. - 1994
28 Logimix: A self-applicable Partial Evaluator for Prolog (context) - Mogensen, Bondorf - 1992
26 Declarative Modeling of the Operational Behaviour of Logic L.. (context) - Falaschi, Levi et al. - 1989
23 Finiteness Analysis (context) - Holst - 1991
19 The Underlying Search for Magic Templates and Tabulation - Bol, Degerstedt - 1993
10 BTA algorithms to ensure Termination of offline Partial Eval.. - Glenstrup, Jones - 1996
10 Preserving Termination of Tabled Logic Programs While Unfold.. - Leuschel, Martens et al. - 1997
9 OLDT-based Abstract Interpretation (context) - Kanamori, Kawamura - 1993
9 Efficiently Generating Efficient Generating Extensions in Pr.. (context) - Jrgensen, Leuschel - 1996
2 A Framework for Analysing the Termination of Definite Logic .. (context) - De Schreye, Verschaetse et al. - 1992
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