Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus  Home/Search
Context
Related
| di.unipi.it/~ruggieri/Paper...smaus.pdf 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: di.unipi.it/~ruggieri/pubnew (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the corresponding classes of programs. For each class, we focus on a su#cient, and in most cases ... (Update)
Active bibliography (related documents): More All
2.2: Termination of Simply Moded Logic Programs with Dynamic.. - Bossi, Etalle, Rossi.. (2004) (Correct)
1.9: Bounded Nondeterminism of Logic Programs - Pedreschi, Ruggieri (1999) (Correct)
1.4: On Logic Programs That Always Succeed - Pedreschi, Ruggieri (Correct)
Similar documents based on text: More All
0.3: Verification of Logic Programs - Pedreschi, Ruggieri (1997) (Correct)
0.3: Verification of Meta-interpreters - Pedreschi, Ruggieri (1997) (Correct)
0.3: On Logic Programs That Do Not Fail - Pedreschi, Ruggieri (1997) (Correct)
BibTeX entry: (Update)
@misc{ pedreschi-characterisations,
author = "Dino Pedreschi and Salvatore Ruggieri and Jan-Georg Smaus",
title = "Characterisations of Termination in Logic Programming",
url = "citeseer.ist.psu.edu/640184.html" }
Citations (may not include all citations):440 The Art of Prolog (context) - Sterling, Shapiro - 1986
223 Assigning meaning to programs (context) - Floyd - 1967
179 The Godel Programming Language (context) - Hill, Lloyd - 1994
130 From Logic Programming to Prolog (context) - Apt - 1997
116 Reasoning about termination of pure Prolog programs - Apt, Pedreschi - 1993
82 ACM Transactions on Programming Languages and Systems (context) - Debray, Lin et al. - 1993
72 New Generation Computing (context) - Apt, Bezem - 1991
70 A Grammatical View of Logic Programming (context) - Deransart, Maluszynski - 1993
64 Communications of the ACM (context) - Kowalski, Logic - 1979
61 Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
53 A semantic basis for the termination analysis of logic progr.. - Codish, Taboch - 1999
48 the unification free Prolog programs - Apt, Etalle - 1993
47 Modular termination proofs for logic and pure Prolog program.. - Apt, Pedreschi
47 Automatic termination analysis of logic programs (context) - Lindenstrauss, Sagiv - 1997
41 Department of Computer Science (context) - Thom, Zobel et al. - 1988
37 SICStus Prolog User's Manual (context) - of, Science - 2003
36 Transformational methodology for proving termination of logi.. - Rao, Kapur et al. - 1998
36 A transformational methodology for proving termination of lo.. - Rao, Kapur et al. - 1992
34 Strong termination of logic programs - Bezem - 1993
33 Norms on terms and their use in proving universal terminatio.. (context) - Bossi, Cocco et al. - 1994
32 Inferring left-terminating classes of queries for constraint.. - Mesnard - 1996
31 Termination analysis for Mercury - Speirs, Somogyi et al. - 1997
30 Automatic inference of norms: A missing link in automatic te.. (context) - Decorte, De Schreye et al. - 1993
29 and completeness properties for logic programs (context) - Cavedon, consistency - 1989
29 Termination proofs of well-moded logic programs via conditio.. (context) - Ganzinger, Waldmann - 1992
28 Automatically proving termination and innermost normalisatio.. (context) - Arts - 1997
26 cient purely declarative logic programming language (context) - Somogyi, Henderson et al. - 1996
24 Termination of well-moded programs - Etalle, Bossi et al. - 1999
23 Verification of logic programs with delay declarations - Apt, Luitjes - 1995
23 An analysis of loop checking mechanism for logic programs (context) - Bol, Apt et al. - 1991
23 Coroutining and the construction of terminating logic progra.. - Naish - 1992
22 Constraint-based termination analysis of logic programs - Decorte, De Schreye et al. - 1999
22 Cardinality analysis of Prolog - Braem, Le Charlier et al. - 1994
19 Proving termination properties of Prolog programs: a semanti.. (context) - Baudinet - 1992
18 Applying static analysis techniques for inferring terminatio.. (context) - Mesnard, Neumerkel - 2001
16 A general framework for automatic termination analysis of lo.. - Dershowitz, Lindenstrauss et al. - 2001
16 Proving termination of input-consuming logic programs - Smaus - 1999
15 Proving termination of GHC programs - Rao, Kapur et al. - 1997
15 Proving termination of logic program by transforming them in.. (context) - Aguzzi, Modigliani - 1993
13 and optimization using the Ciao system preprocessor (context) - Hermenegildo, Bueno et al. - 1999
12 Termination analysis for tabled logic programming - Decorte, De Schreye et al. - 1998
10 Modes and Types in Logic Programming (context) - Smaus - 1999
10 A framework for analyzing the termination of definite logic .. (context) - De Schreye, Verschaetse et al. - 1992
10 On termination of constraint logic programs - Colussi, Marchiori et al. - 1995
10 terminating logic programs (context) - Martin, King et al. - 1997
9 On proving left-termination of constraint logic programs - Mesnard, Ruggieri - 2003
9 TALP: A tool for the termination analysis of logic programs - Ohlebusch, Claves et al. - 2000
8 Compositional Logic Programming - McPhee - 2000
8 a parallel logic programming language with the concept of a .. (context) - Ueda, Clauses - 1988
8 On termination of logic programs with delay declarations (context) - Marchiori, Teusink - 1999
7 Termination of constraint logic programs (context) - Ruggieri - 1997
7 Dipartimento di Informatica (context) - Ruggieri, Validation et al. - 1999
7 Detecting unsolvable queries for definite logic programs - Bruynooghe, Vandecasteele et al. - 1998
6 A declarative approach for firstorder built-in's of Prolog - Apt, Marchiori et al. - 1994
4 Acceptability with general orderings - De Schreye, Serebrenik - 2002
4 Verifying termination and error-freedom of logic programs wi.. - Smaus, Hill et al. - 2001
4 Semantics and termination of simply moded logic programs wit.. - Bossi, Etalle et al. - 2004
4 On logic programs that always succeed. Science of Computer P.. - Pedreschi, Ruggieri - 1999
4 Theory and Practice of Logic Programming (context) - Pedreschi, Ruggieri et al. - 2002
4 Theory and Practice of Logic Programming (context) - Bossi, Etalle et al. - 2002
3 On termination of general logic programs w (context) - Marchiori - 1996
3 Bounded nondeterminism of logic programs - Pedreschi, Ruggieri - 1999
3 Proving existential termination of normal logic programs - Marchiori
3 Inferring and compiling termination for constraint logic pro.. - Hoarau, Mesnard - 1998
3 On modular termination proofs of general logic programs - Bossi, Cocco et al. - 2002
2 Control generation for logic programs (context) - Luttringhaus-Kappel - 1993
2 universal termination of logic programs (context) - Ruggieri - 2001
2 Termination Analysis of Logic Programs - Serebrenik - 2003
2 On termination of logic programs with floating point computa.. - Serebrenik, De Schreye - 2002
2 Termination analysis for abductive general logic programs - Verbaeten - 1999
2 Proving termination of constraint solver programs (context) - Fruhwirth - 2000
2 Detecting optimal termination conditions of logic programs (context) - Mesnard, Payet et al. - 2002
1 Semantics of input-consuming logic programs - Bossi, Etalle et al. - 2000
1 Termination proofs for logic programs with tabling - Verbaeten, Sagonas et al. - 2001
1 Negation as failure through abduction: Reasoning about termi.. (context) - Pedreschi, Mancarella et al.
1 An abstract interpretation approach to termination of logic .. (context) - Gori - 2000
1 Termination of logic programs for various dynamic selection .. (context) - Smaus - 2003
Documents on the same site (http://www.di.unipi.it/~ruggieri/pubnew.html): More
Bounded Nondeterminism of Logic Programs - Pedreschi, Ruggieri (1999) (Correct)
Weakest Preconditions for Pure Prolog Programs - Pedreschi, Ruggieri (1998) (Correct)
Termination is Language-independent - Pedreschi, Ruggieri (1994) (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