Alexander Serebrenik, Danny De Schreye  Home/Search
Context Related
| cs.kuleuven.ac.be/publica...CW284.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/pub...CW284.abs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new approach to termination analysis of logic programs. (Update)
Context of citations to this paper: More
...all atoms A, such that a variant of A is a selected atom in some branch of the LD tree for P[f Qg, for some Q 2 S. The following de nition [24] generalises the notion of acceptability with respect to a set [10, 11] by extending it to mutual recursion. De nition 2. Let S be a set...
.... of logic programs can be proved via general term orderings, similar to those used to prove termination of term rewrite systems [9]. Second, if is an ordering such that termination of a meta program, obtained from vanilla and an object program P , with respect to a goal...
Cited by: More
On Termination of Programs with Real Numbers Computations - Serebrenik, De Schreye (2002) (Correct)
On Termination of Meta-Programs - Serebrenik, De Schreye (2001) (Correct)
On Termination of Logic Programs With Floating Point.. - Serebrenik, De Schreye (2002) (Correct)
Similar documents (at the sentence level): More
41.7%: Non-transformational Termination Analysis of Logic.. - Serebrenik, De Schreye (2001) (Correct)
29.1%: Termination Analysis of Logic Programs Using.. - Serebrenik, De Schreye (2000) (Correct)
16.4%: Acceptability with General Orderings - De Schreye, Serebrenik (2002) (Correct)
Active bibliography (related documents): More All
0.2: Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
0.2: Inference of Termination Conditions for Numerical Loops - Serebrenik, De Schreye (2001) (Correct)
0.2: Inference of Termination Conditions for Numerical Loops in.. - Serebrenik, De Schreye (2001) (Correct)
Similar documents based on text: More All
0.6: Inference of termination conditions for numerical loops in.. - Serebrenik, De Schreye (2003) (Correct)
0.4: Refactoring Prolog Programs - Schrijvers, Serebrenik, Demoen (2001) (Correct)
0.3: Modular Termination Proofs for Prolog with Tabling - Verbaeten, Sagonas, De Schreye (1999) (Correct)
Related documents from co-citation: More All
2: Information Technology---Language Independent Arithmetic---Part 1: Integer and F.. - - 1994
2: A declarative approach for rstorder built-in's of Prolog (context) - Apt, Marchiori et al. - 1994
2: A general framework for automatic termination analysis of logic programs - Dershowitz, Lindenstrauss et al. - 2000
BibTeX entry: (Update)
A. Serebrenik and D. De Schreye. Non-transformational termination analysis of logic programs, based on general term-orderings. In K.-K. Lau, editor, LOPSTR 2001, 10th Int. Workshop, Selected Papers, volume 2042 of LNCS, pages 69-85. Springer Verlag, 2001. http://citeseer.ist.psu.edu/serebrenik00nontransformational.html More
@article{ serebrenik01nontransformational,
author = "Alexander Serebrenik and Danny De Schreye",
title = "Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings",
journal = "Lecture Notes in Computer Science",
volume = "2042",
pages = "69--??",
year = "2001",
url = "citeseer.ist.psu.edu/serebrenik00nontransformational.html" }
Citations (may not include all citations):440 The Art of Prolog (context) - Sterling, Shapiro - 1994
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
130 From Logic Programming to Prolog (context) - Apt - 1997
61 Termination of logic programs: The never-ending story (context) - De Schreye, Decorte - 1994
59 Studies in Pure Prolog: Termination (context) - Apt, Pedreschi
48 the unification free Prolog programs - Apt, Etalle - 1993
41 Characterizing termination of logic programs with level mapp.. (context) - Bezem - 1989
36 Transformational methodology for proving termination of logi.. - Rao, Kapur et al. - 1998
32 Topics in termination (context) - Dershowitz, Hoot - 1993
28 Automatically proving termination and innermost normalisatio.. (context) - Arts - 1997
22 Constraint-based termination analysis of logic programs - Decorte, De Schreye et al. - 1999
18 Termination of logic programs using semantic unification - Arts, Zantema - 1995
17 Termination analysis: some practical properties of the norm .. (context) - Decorte, De Schreye - 1998
15 Lecture Notes in Artificial Intelligence (context) - Plumer, for - 1990
11 Static termination analysis for definite Horn clause program.. (context) - Verschaetse - 1992
10 A framework for analyzing the termination of definite logic .. (context) - De Schreye, Verschaetse et al. - 1992
10 Well-foundedness of term orderings - Ferreira, Zantema - 1995
6 Rewrite method for theorem proving in first order theory wit.. (context) - Hsiang - 1987
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