for Termination Analysis of Logic Programs Manh Thang Nguyen, Danny De...  Home/Search
Context
Related
| cs.kuleuven.ac.be/~dtai/p...41784.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/...2005E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a new technique for termination analysis of definite logic programs based on polynomial interpretations. The principle of this technique is to map each function and predicate symbol to a polynomial over some domain of natural numbers, like it has been done in proving termination of term rewriting systems. Such polynomial interpretations can be seen as a direct generalisation of the traditional techniques in termination analysis of LPs, where (semi-) linear norms and ... (Update)
Active bibliography (related documents): More All
1.3: Polynomial Interpretations as a Basis - For Termination Analysis (Correct)
0.7: Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
0.3: Modular & Incremental Automated Termination Proofs - Urbain (2004) (Correct)
Similar documents based on text: More All
0.4: Inference of termination conditions for numerical loops in.. - Serebrenik, De Schreye (2003) (Correct)
0.4: On Termination of Meta-Programs - Serebrenik, De Schreye (2003) (Correct)
0.4: Flight Effectiveness Analysis in Airline Business: A Formal Model - Tran Manh (1998) (Correct)
BibTeX entry: (Update)
@misc{ analysis-polynomial,
author = "For Termination Analysis",
title = "Polynomial Interpretations as a Basis",
url = "citeseer.ist.psu.edu/733944.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
192 Logic programming (context) - Apt - 1990
129 Termination of rewriting (context) - Dershowitz - 1987
89 Deriving descriptions of possible values of program variable.. (context) - Janssen, Bruynooghe - 1992
85 On proving term rewriting systems are noetherian (context) - Lankford - 1979
61 Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
49 Generating polynomial orderings for termination proofs - Giesl - 1995
34 Proving termination of logic programs by exploiting term pro.. (context) - Bossi, Cocco et al. - 1991
32 Generating polynomial orderings (context) - Steinbach - 1994
26 Declarative modeling of the operational behaviour of logic l.. (context) - Falaschi, Levi et al. - 1989
22 Deriving termination proofs for logic programs (context) - Verschaetse, De Schreye - 1991
16 examples of termination - Dershowitz - 1995
12 Constraint based automatic termination analysis of logic pro.. (context) - Decorte, De Schreye et al. - 1999
4 Acceptability with general orderings - De Schreye, Serebrenik - 2002
3 Mechanically proving termination using polynomial interpreta.. (context) - Contejean, Marche et al. - 2005
2 Termination Analysis of Logic Programs - Serebrenik - 2003
2 Polynomial interpretations as a basis for termination analys.. (context) - Nguyen, De Schreye - 2005
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2005-E.shtml): More
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) (Correct)
Experiments with Relational Neural Networks - Uwents, Blockeel (Correct)
Guard Simplification in CHR programs - Sneyers, Schrijvers, Demoen (2004) (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