Download:
|
by Femke Van Raamsdonk
Proceedings of the 14th International Conference on Logic Programming
http://www.cs.vu.nl/~femke/ps/iclp97.ps
Add To MetaCart
Abstract:
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. 1
Citations
|
160
|
From Logic Programming to Prolog
– Apt
- 1997
|
|
149
|
The execution algorithm of Mercury: An efficient purely declarative logic programming language
– Somogyi, Henderson, et al.
- 1996
|
|
81
|
On the unification free prolog programs
– Apt, Etalle
- 1993
|
|
46
|
AND-parallelism with intelligent backtracking for annotated logic programs
– Dembinski, Maluszynski
- 1985
|
|
45
|
E.: Completeness results for basic narrowing
– Middeldorp, Hamoen
- 1994
|
|
40
|
The automatic generation of mode declarations for Prolog programs
– Mellish
- 1981
|
|
32
|
A transformational methodology for proving termination of logic programs
– Rao, Kapur, et al.
- 1991
|
|
31
|
Termination proofs of well-moded logic programs via conditional rewrite systems
– Ganzinger, Waldmann
- 1993
|
|
29
|
Transformation of logic programs into functional programs
– Reddy
- 1984
|
|
20
|
Termination of logic programs using semantic unification
– Arts, Zantema
- 1995
|
|
17
|
Proving termination of logic programs by transforming them into equivalent term rewriting systems
– Aguzzi, Modigliani
- 1993
|
|
17
|
Logic programs as term rewriting systems
– Marchiori
- 1994
|
|
16
|
Unravelings and ultra-properties
– Marchiori
- 1996
|
|
13
|
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs
– Avenhaus, Lor'ia-S'aenz
- 1994
|
|
2
|
Automatically proving termination and innermost termination of term rewriting systems
– Arts
- 1997
|
|
2
|
Contributions to the Theory of Logic-Functional Programming
– Bockmayr
- 1990
|
|
1
|
Conditional narrowing modulo a set of equations
– Bockmayr
- 1993
|