Abstract
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is defined which given a logic program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a one-to-one correspondence between computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic program terminates iff the corresponding TRS terminates. This transform is refined in such a way that the above results hold for a relevant class of unification free programs containing SWM, the class of Flatly Well Moded (FWM) programs.
This work was done during an author's stay at CWI, Amsterdam.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and S. Etalle. On the unification free Prolog programs. In S. Sokolowski, editor, MFCS'93, LNCS, pp. 1–19. Springer, 1993.
G. Aguzzi and U. Modigliani. Proving termination of logic programs by transforming them into equivalent term rewriting systems. FST&TCS'93, LNCS. Springer, 1993.
K.R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 10, pp. 495–574. Elsevier — MIT Press, 1990.
F. Bronsard, T.K. Lakshman, and U.S Reddy. A framework of directionality for proving termination of logic programs. In K.R. Apt, editor, JICSLP'92, pp. 321–335. MIT Press, 1992.
N. Dershowitz. Termination of rewriting. JSC, 3:69–116, 1987.
N. Dershowitz and J. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pp. 243–320. Elsevier — MIT Press, 1990.
P. Dembinski and J. Maluszyński. AND-parallelism with intelligent backtracking for annotated logic programs. ILPS'85, pp. 29–38, 1985.
H. Ganzinger and U. Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. In M. Rusinowitch and J.L Rémy, editors, CTRS'92, pp. 216–222, July 1992.
J.VV. Klop. Term rewriting systems. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pp. 1–116. Clarendon Press, Oxford, 1992.
M.R.K. Krishna Rao, D. Kapur, and R.K. Shyamasundar. A transformational methodology for proving termination of logic programs. In CSL '92, Volume 626 of LNCS, pp. 213–226, Berlin, 1992. Springer.
J.W. Lloyd. Foundations of Logic Programming. Springer, 2nd ed., 1987.
M. Marchiori. Logic programming, matching and term rewriting systems. Master's thesis, Dep. of Pure and Applied Mathematics, University of Padova, Italy, July 1993. In Italian.
M. Marchiori. Localizations of unification freedom through matching directions. Submitted, March 1994.
J. Maluszyński and H.J. Komorowski. Unification-free execution of logic programs. IEEE Symposium on Logic Programming, pp. 78–86, 1985.
R.K. Shyamasundar, M.R.K. Krishna Rao, and D. Kapur. Termination of logic programs. Computer science group, Tata Institute of Fundamental Research, Bombay, India, 1990. Revised version: Rewriting concepts in the study of termination of logic programs, ALPUK, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Marchiori, M. (1994). Logic programs as term rewriting systems. In: Levi, G., RodrÃguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1994. Lecture Notes in Computer Science, vol 850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58431-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-58431-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58431-5
Online ISBN: 978-3-540-48791-3
eBook Packages: Springer Book Archive