Abstract
Unfoldings of oriented graphs generate infinite trees that we generalize by weighting arrows of these graphs. Indexes along a branch are added during unfoldings and the result indexes variables. We study formal properties of these graphs (substitution, equivalence, unification, ...). We use them to solve the halting problem of a recursive head-rewriting rule (as in PROLOG-like languages).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
COURCELLE B., Equivalences and transformations of regular systems, applications to recursive program schemes and grammars. Université de BORDEAUX, no 8430, Decembre 1984
DERSHOWITZ B., A theoretical Basis for the Reduction of Polynomials to Canonical Forms. ACM-SIGSAM Bulletin, 39, August 1976, pp. 19–29
DEVIENNE Ph. and LEBEGUE P., Rapport Technique sur les GO's pondérés, Thesis, to appear.
FAGES F., Notes sur l'unification des termes de premier ordre finis ou infinis. Internal report INRIA-LITP
GREIBACH., An infinite hierarchy of context-free languages. JACM, 16,1 (1969), pp. 91–106
HEREL D., KOZEN D., PARIKH R., Process Logic: Expressiveness, Decidability, Completeness. J. of Computer and System Sci., 25 (1982), pp. 144–170.
HUET G., Confluent reductions: Abstract properties and applications to term rewriting systems JACM, 27 (1980), pp. 797–821
KOZEN D., Indexings of subrecursive classes. Theoretical Computer Science, 11 (1980), pp. 227–301
KOZEN D., Lower bounds for natural proof systems. 18th F.O.C.S., (1977), pp. 254–266.
LESCANNE P., How to prove termination ? An approach to the implementation of a new recursive decomposition ordering. Proceedings of an NSF Workshop on the Rewrite Rule Laboratory Sept. 6–9 (1983), (Eds GUTTAG, KAPUR, MUSSER), General Electric Research and Development Center Report 84GEM008, April 1984, pp. 109–121.
LLOYD J.W., Foundations of logic programming. Springer Verlag, (1984)
MARTELLI A. and MONTANARI U., An efficient unification algorithm Transactions on Programming Languages and Systems 4, 2 (1982) pp. 256–282
PATERSON M.S. and WEGMAN M.N., Linear unification. J. of Computer and Systems Sci., 16 (1978), pp. 158–167
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Devienne, P., Lebegue, P. (1986). Weighted graphs : A tool for logic programming. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022662
Download citation
DOI: https://doi.org/10.1007/BFb0022662
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16443-2
Online ISBN: 978-3-540-39783-0
eBook Packages: Springer Book Archive