Results 1 
5 of
5
On Proving Left Termination of Constraint Logic Programs
 ACM Transaction on Computational Logic
, 2001
"... The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this paper, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete characterization of left termination for ideal CL ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this paper, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete characterization of left termination for ideal CLP languages which generalizes acceptability of logic programs. The characterization is then refined to the notion of partial acceptability, which is wellsuited for automatic modular inference. We describe a theoretical framework for automation of the approach, which is implemented. For nonideal CLP languages and without any assumption on their incomplete constraint solvers, even the most basic sound termination criterion from logic programming does not lift. We focus on a specific system, namely CLP(R), by proposing some additional conditions that make (partial) acceptability sound
Proving Termination of InputConsuming Logic Programs
, 1999
"... A class of predicates is identified for which termination does not depend on lefttoright execution. The only assumption about the selection rule is that derivations are inputconsuming, that is, in each derivation step, the input arguments of the selected atom do not become instantiated. This assu ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
A class of predicates is identified for which termination does not depend on lefttoright execution. The only assumption about the selection rule is that derivations are inputconsuming, that is, in each derivation step, the input arguments of the selected atom do not become instantiated. This assumption is a natural abstraction of previous work on programs with delay declarations. The method for showing that a predicate is in that class is based on level mappings, closely following the traditional approach for LDderivations. Programs are assumed to be well and nicely moded, which are two widely used concepts for verification. Many predicates terminate under such weak assumptions. Knowing these predicates is useful even for programs where not all predicates have this property.
Verifying Termination and ErrorFreedom of Logic Programs with block Declarations
 THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2001
"... We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to builtins. Concerning termination, we present two approaches. The first approach tries to eliminate the wellknown problem of speculative output bind ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to builtins. Concerning termination, we present two approaches. The first approach tries to eliminate the wellknown problem of speculative output bindings. The second approach is based on identifying the predicates for which the textual position of an atom using this predicate is irrelevant with respect to termination. Three features are distinctive of this work: it allows for predicates to be used in several modes; it shows that block declarations, which are a very simple delay construct, are sufficient to ensure the desired properties; it takes the selection rule into account, assuming it to be as in most Prolog implementations. The methods can be used to verify existing programs and assist in writing new programs.
Bounded Nondeterminism of Logic Programs
 Proc. of the International Conference on Logic Programming
, 1999
"... We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for them via any selection rule. We o#er a declarative characterization of the class of programs and queries that have bounded ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for them via any selection rule. We o#er a declarative characterization of the class of programs and queries that have bounded nondeterminism by defining bounded programs and queries. The characterization is provided in terms of Herbrand interpretations and level mappings, in the style of existing characterizations of universal termination.
Termination of Simply Moded Logic Programs with Dynamic Scheduling
 TRANSACTIONS ON COMPUTATIONAL LOGIC
, 2003
"... In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the lefttoright one of Prolog. Input consuming derivations were introduced to model d ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the lefttoright one of Prolog. Input consuming derivations were introduced to model dynamic scheduling while abstracting from the technical details. In this article, we provide a sufficient and necessary criterion for termination of input consuming derivations of simply moded logic programs. The termination criterion we propose is based on a denotational semantics for partial derivations which is defined in the spirit of modeltheoretic semantics previously proposed for lefttoright derivations.