Unfold/fold transformations of logic programs
- 1 June 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 2 (2) , 143-157
- https://doi.org/10.1017/s0960129500001419
Abstract
Unfold/fold transformations have been used in logic programming for some years to transform programs into more efficient ones. We describe recent work on the extent to which these transformations produce programs which are equivalent to the original one. Various notions of equivalence are considered: same success set; finite failure set; least Herbrand model; completion. This is used to illustrate the rather unsatisfactory relationship between logic programming and logic shown by the wide variety of different declarative semantics proposed for logic programs.Keywords
This publication has 8 references indexed in Scilit:
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- On the declarative and procedural semantics of logic programsJournal of Automated Reasoning, 1989
- On the Declarative Semantics of Deductive Databases and Logic ProgramsPublished by Elsevier ,1988
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Derivation of Logic ProgramsJournal of the ACM, 1981
- Synthesis: Dreams → ProgramsIEEE Transactions on Software Engineering, 1979
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Knowledge and reasoning in program synthesisArtificial Intelligence, 1975