Weighted Graphs: A Tool for Logic Programming

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).

[1]  Matthew Hennessy,et al.  A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus , 1980, Theor. Comput. Sci..

[2]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[3]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[5]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[6]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[7]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[8]  Bruno Buchberger,et al.  A theoretical basis for the reduction of polynomials to canonical forms , 1976, SIGS.

[9]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1969, JACM.

[10]  Dexter Kozen,et al.  Indexings of Subrecursive Classes , 1980, Theor. Comput. Sci..

[11]  David Harel,et al.  Process logic: Expressiveness, decidability, completeness , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.