Transforming acyclic programs
Annalisa Bossi,Sandro Etalle +1 more
TL;DR: It is proved that the Unfold/Fold transformation system defined by Tamaki and Sato preserves the acyclicity of the initial program, and that when the transformation is applied to an acyClic program, then the finite failure set for definite programs is preserved.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Introduction to logic programming
Jean-Marie Jacquet
- 21 Nov 1993
TL;DR: This introduction to logic programming is based on Haskell, a very simple way of programming that can be applied to any kind of computer programming.
102
Conjunctive Partial Deduction in Practice
Jesper Jørgensen,Michael Leuschel,Bern Martens +2 more
- 28 Aug 1996
TL;DR: Recently, partial deduction of logic programs has been extended to conceptually embed folding, so that partial deductions are no longer computed of single atoms, but rather of entire conjunctions.
Transforming Constraint Logic Programs
N. Bensaou,Irène Guessarian +1 more
- 24 Feb 1994
TL;DR: The Tamaki-Sato transformation system is extended into a fold-unfold transformation system which can take care of constraints and a direct proof of its correctness is given which is simpler than the Tamaki -Sato proof.
18
Correctness of Logic Program Transformations Based on Existential Termination.
Kung-Kiu Lau,Mario Ornaghi,Alberto Pettorossi,Maurizio Proietti +3 more
- 01 Jan 1995
TL;DR: Using the proposed invariants which are based on Clark completion, these proofs are much simpler than those done by induction on the construction of the SLD-trees, like the ones proposed in the literature for related results.
9
References
A kripke-kleene semantics for logic programs**
TL;DR: The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program, when queried, will do one of three things: succeed with the query, fail with it, or not respond because it has fallen into infinite backtracking.
632
Unfold/Fold Transformations of Logic Programs.
Philippa Gardner,John C. Shepherdson +1 more
- 01 Jan 1991
TL;DR: This work describes recent work on the extent to whichfold/fold transformations produce programs which are equivalent to the original one and illustrates the rather unsatisfactory relationship between logic programming and logic shown by the wide variety of different declarative semantics proposed for logic programs.
210
•Book
Introduction to logic programming
Jean-Marie Jacquet
- 21 Nov 1993
TL;DR: This introduction to logic programming is based on Haskell, a very simple way of programming that can be applied to any kind of computer programming.
102
Acyclic logic programs and the completeness of SLDNF-resolution
Guozhu Dong,Seymour Ginsburg +1 more
TL;DR: It is proved completeness of SLDNF-resolution for the acyclic programs and several other desirable properties exhibited by programs belonging to this class are discussed.
35