Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming

Philippe Devienne. Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming. Theoretical Computer Science, 75(1&2):157-215, 1990.

@article{Devienne90,
  title = {Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming},
  author = {Philippe Devienne},
  year = {1990},
  tags = {term rewriting, graph-rewriting, logic programming, programming, logic, rewriting logic, rewriting},
  researchr = {https://researchr.org/publication/Devienne90},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {75},
  number = {1&2},
  pages = {157-215},
}