Decreasing Diagrams and Relative Termination

  • Authors:

  • Nao Hirokawa;Aart Middeldorp

  • Affiliations:

  • School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, Japan 923-1292;Institute of Computer Science, University of Innsbruck, Innsbruck, Austria 6020

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we use the decreasing diagrams technique to show that a left-linear and locally confluent term rewrite system $\mathcal{R}$ is confluent if the critical pair steps are relatively terminating with respect to $\mathcal{R}$ . We further show how to encode the rule-labeling heuristic for decreasing diagrams as a satisfiability problem. Experimental data for both methods are presented.