Advertisement
Published in:
2010 | OriginalPaper | Chapter
Decreasing Diagrams and Relative Termination
Authors : Nao Hirokawa, Aart Middeldorp
Published in: Automated Reasoning
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.