论文信息 - Translating Logic Programs into Conditional Rewriting Systems

Translating Logic Programs into Conditional Rewriting Systems

In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is defined. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness.

Femke van Raamsdonk

[2] Harald Ganzinger,et al. Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems , 1992, CTRS.

[3] G. Aguzzi,et al. Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems , 1993, FSTTCS.

[4] Uday S. Reddy,et al. Transformation of Logic Programs into Functional Programs , 1984, SLP.

[5] Jürgen Avenhaus,et al. On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs , 1994, LPAR.

[6] Massimo Marchiori,et al. Unravelings and Ultra-properties , 1996, ALP.

[7] Sandro Etalle,et al. On the Unification Free Prolog Programs , 1993, MFCS.

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

[9] Massimo Marchiori. Logic Programs as term Rewriting Systems , 1994, ALP.

[10] Hans Zantema,et al. Termination of Logic Programs Using Semantic Unification , 1995, LOPSTR.

[11] Deepak Kapur,et al. A Transformational Methodology for Proving Termination of Logic Programs , 1991, CSL.

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

[13] Jan Maluszynski,et al. AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs , 1985, SLP.