Properties of Input-Consuming Derivations

Abstract We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations do not employ a fixed selection rule, and can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations. We consider the class of nicely-moded programs and queries. We show that for these programs one part of the well-known Switching Lemma holds also for input-consuming derivations. Furthermore, we provide conditions which guarantee that all input-consuming derivations starting in a Nicely-Moded query are finite. The method presented here is easy to apply and generalizes other related works.

[1]  John W. Lloyd.  Proving Termination of Logic Programs with Delay Declarations , 1995 .

[2]  Marc Bezem,et al.  Strong Termination of Logic Programs , 1991, J. Log. Program..

[3]  John W. Lloyd,et al.  The Go¨del programming language , 1994 .

[4]  Krzysztof R. Apt,et al.  Verification of Logic Programs with Delay Declarations , 1995, AMAST.

[5]  Joachim Schimpf,et al.  ECLiPSe: A Platform for Constraint Logic Programming , 1997 .

[6]  Maurizio Gabbrielli,et al.  Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators , 1997, Inf. Comput..

[7]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[8]  Krzysztof R. Apt,et al.  Introduction to Logic Programming , 1988 .

[9]  Andy King,et al.  Termination of Logic Programs with block Declarations Running in Several Modes , 1998, PLILP/ALP.

[10]  Elena Marchiori,et al.  Termination of Logic Programs with Delay Declarations , 1999, J. Log. Program..

[11]  Zoltan Somogyi,et al.  The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language , 1996, J. Log. Program..

[12]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

[13]  Danny De Schreye.  Proving Termination of Input-Consuming Logic Programs , 1999 .

[14]  Danny De Schreye,et al.  Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis , 1993, ILPS.

[15]  Lee Naish.  Parallelizing NU-Prolog , 1988, ICLP/SLP.

[16]  Jan-Georg Smaus.  Modes and types in logic programming , 1999 .

[17]  Kazunori Ueda,et al.  GHC - A Language for a New Age of Parallel Programming , 1988, FSTTCS.

[18]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[19]  Lee Naish,et al.  Coroutining and the construction of terminating logic programs , 1992 .

[20]  K. Ueds,et al.  Guarded horn clauses: A parallel logic programming language with the concept of a guard , 1988 .

[21]  Krzysztof R. Apt,et al.  From logic programming to Prolog , 1996, Prentice Hall International series in computer science.

[22]  Mats Carlsson,et al.  SICStus Prolog User''s Manual , 1993 .

[23]  Danny De Schreye,et al.  Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..

[24]  Sandro Etalle,et al.  Termination of Well-Moded Programs , 1999, J. Log. Program..

[25]  S. Ginsburg,et al.  Acyclic logic programs and the completeness of SLDNF-resolution , 1991 .

[26]  Giorgio Levi.  Advances in logic programming theory , 1995 .

[27]  Sandro Etalle,et al.  A transformation system for CLP with dynamic scheduling and CCP , 1997 .

[28]  Dino Pedreschi,et al.  Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..

[29]  Krzysztof R. Apt,et al.  On the occur-check-free PROLOG programs , 1994, TOPL.

[30]  John W. Lloyd,et al.  The Gödel programming language , 1994 .

[31]  Lawrence Cavedon,et al.  Acyclic Logic Programs and the Completeness of SLDNF-Resolution , 1991, Theor. Comput. Sci..

[32]  Kim Marriott.  Algebraic and Logical Semantics for CLP Languages with Dynamic Scheduling , 1997, J. Log. Program..

[33]  Dino Pedreschi,et al.  Modular termination proofs for logic and pure PROLOG programs , 1993 .