Abstract
Tamaki and Sato were perhaps among the first to study folding in logic programs. These authors considered the folding of a single clause (E) using a single-clause definition (D) to give a folded clause (F):
\(\frac{B \leftarrow Q (D) A \leftarrow Q\Theta, R (E)}{A \leftarrow B\Theta, R(F)}\)fold
plus some syntactic conditions, later refined by Gardner and Shepherdson. Here and throughout, A and B denote atoms, and Q and R denote tuples of literals.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Pettorossi, A., Proietti, M., Renault, S.: Enhancing partial deduction via unfold/ fold rules. In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol. 1207, pp. 146–168. Springer, Heidelberg (1997)
Roychoudhury, A., Narayan Kumar, K., Ramakrishnan, C.R., Ramakrishnan, I.V.: Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs. Intl. Journal of Foundations of Computer Science 13(3), 387–403 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenblueth, D.A. (2003). A Distinct-Head Folding Rule. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-24599-5_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20642-2
Online ISBN: 978-3-540-24599-5
eBook Packages: Springer Book Archive