Alexander Serebrenik, Danny De Schreye  Home/Search
Context Related
| cs.kuleuven.ac.be/publica...CW291.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...CW291.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
...monotone (has a subterm property) on a specified subset of argument positions. The formal study of these weaker notions may be found in [20]. Example 3. Let f be a functor of arity two, and a, b two terms, such that a b. Let f be monotone in the first argument position. Then,...
...is monotone (has a subterm property) on a specified subset of argument positions. The formal study of these weaker notions may be found in [27]. Example 3. Let f be a functor of arity two, and a, b two terms, such that a b. Let f be monotone in the first argument position....
Cited by: More
Acceptability with General Orderings - De Schreye, Serebrenik (2002) (Correct)
Non-transformational Termination Analysis of Logic.. - Serebrenik, De Schreye (2001) (Correct)
Similar documents (at the sentence level):
18.1%: Non-transformational termination analysis of Logic.. - Serebrenik, De Schreye (2000) (Correct)
10.9%: Termination Analysis of Logic Programs - Serebrenik (2003) (Correct)
Active bibliography (related documents): More All
0.3: 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
1.0: On Termination of Meta-Programs - Serebrenik, De Schreye (2001) (Correct)
0.6: Inference of termination conditions for numerical loops in.. - Serebrenik, De Schreye (2003) (Correct)
0.5: On Termination of Programs with Real Numbers Computations - Serebrenik, De Schreye (2002) (Correct)
Related documents from co-citation: More All
2: A framework for analyzing the termination of definite logic programs with respec.. (context) - De Schreye, Verschaetse et al. - 1992
2: Automatically proving termination and innermost normalisation of term rewriting .. (context) - Arts - 1997
2: Proving Termination with Multiset Orderings (context) - Dershowitz, Manna - 1979
BibTeX entry: (Update)
A. Serebrenik and D. De Schreye. Termination analysis of logic programs using acceptability with general term orders. Technical Report CW 291, Departement Computerwetenschappen, K.U.Leuven, Leuven, Belgium, 2000. Available at http://www.cs.kuleuven.ac.be/publicaties/rapporten/CW2000.html. http://citeseer.ist.psu.edu/serebrenik00termination.html More
@misc{ serebrenik00termination,
author = "A. Serebrenik and D. De Schreye",
title = "Termination analysis of logic programs using acceptability with general
term orders",
text = "A. Serebrenik and D. De Schreye. Termination analysis of logic programs
using acceptability with general term orders. Technical Report CW 291, Departement
Computerwetenschappen, K.U.Leuven, Leuven, Belgium, 2000. Available at http://www.cs.kuleuven.ac.be/publicaties/rapporten/CW2000.html.",
year = "2000",
url = "citeseer.ist.psu.edu/serebrenik00termination.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
89 Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992
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
47 Automatic termination analysis of logic programs (context) - Lindenstrauss, Sagiv - 1997
36 Transformational methodology for proving termination of logi.. - Rao, Kapur et al. - 1998
33 Norms on terms and their use in proving universal terminatio.. (context) - Bossi, Cocco et al. - 1994
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
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