Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/transforming-acyclic-programs-FRYzUTx8Ci
References (25)
-
K. Apt, D. Pedreschi (1993)
Reasoning about Termination of Pure Prolog ProgramsInf. Comput., 106
-
M. Fitting (1985)
A Kripke-Kleene Semantics for Logic ProgramsJ. Log. Program., 2
-
(1993)
February ACM Transactions on Programming Languages and Systems -
M. Bezem (1991)
Strong Termination of Logic ProgramsJ. Log. Program., 15
-
J. Lloyd (1987)
Foundations of logic programming; (2nd extended ed.) -
Taisuke Sato (1990)
Equivalence-Preserving First-Order Unfold/Fold Transformation SystemsTheor. Comput. Sci., 105
-
Teodor Przymusinski (1989)
Every logic program has a natural stratification and an iterated least fixed point model -
A. Bossi, N. Cocco (1993)
Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic ProgramsJ. Log. Program., 16
-
A. Gelder, K. Ross, J. Schlipf (1988)
Unfounded sets and well-founded semantics for general logic programs -
H. Seki (1989)
Unfold/Fold Transformation of Stratified Programs. -
Guozhu Dong, S. Ginsburg (1991)
Acyclic logic programs and the completeness of SLDNF-resolutionTheoretical Computer Science, 90
-
W. Thomas (1990)
Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics -
Michael Maher (1987)
Correctness of a Logic Program Transformation System -
J. Shepherdson (1992)
Unfold/fold transformations of logic programsMathematical Structures in Computer Science, 2
-
H. Seki (1991)
Unfold/Fold Transformations of Stratified ProgramsTheor. Comput. Sci., 86
-
C. Aravindan, P. Dung (1995)
On the Correctness of Unfold/Fold Transformation of Normal and Extended Logic ProgramsJ. Log. Program., 24
-
K. Apt (1988)
Introduction to Logic Programming -
Taisuke Sato (1990)
An Equivalence Preserving First Order Unfold/fold Transformation System -
H. Seki (1993)
Unfold/Fold Transformation of General Logic Programs for the Well-Founded SemanticsJ. Log. Program., 16
-
J. Logtc. Program -
(1978)
Negation as failure rule -
Tadashi Kawamura, T. Kanamori (1990)
Preservation of Stronger Equivalence in Unfold/Fold Logic Program TransformationTheor. Comput. Sci., 75
-
J. Lloyd (1984)
Foundations of Logic Programming -
H. Seki (1990)
A Comparative Study of the Well-Founded and the Stable Model Semantics: Transformation's Viewpoint -
Inf. Comput
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1994 by ACM Inc.
- ISSN
- 0164-0925
- DOI
- 10.1145/183432.183434
- Publisher site
- See Article on Publisher Site
Abstract
An unfold/fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. In the field of logic programming, the class of acyclic programs plays an important role in this respect, since it is closely related to the one of terminating programs. The two classes coincide when negation is not allowed in the bodies of the clauses. We prove that the Unfold/Fold transformation system defined by Tamaki and Sato preserves the acyclicity of the initial program. From this result, it follows that when the transformation is applied to an acyclic program, then the finite failure set for definite programs is preserved; in the case of normal programs, all major declarative and operational semantics are preserved as well. These results cannot be extended to the class of left-terminating programs without modifying the definition of the transformation.
Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) – Association for Computing Machinery
Published: Jul 1, 1994