Decreasing diagrams and relative termination

  • Authors:

  • Nao Hirokawa;Aart Middeldorp

  • Affiliations:

  • School of Information Science, Japan Advanced Institute of Science and Technology, Japan;Institute of Computer Science, University of Innsbruck, Austria

  • Venue:
  • IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system ${\mathcal{R}}$ is confluent if all its critical pairs are joinable and 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.