2026-07-22T06:28:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20342 2024-07-05T06:20:34Z ddc:004 open_access

Simulating Dependency Pairs by Semantic Labeling Saito, Teppei Hirokawa, Nao Term rewriting Relative termination Semantic labeling Dependency pairs We show that termination proofs by a version of the dependency pair method can be simulated by semantic labeling plus multiset path orders. By incorporating a flattening technique into multiset path orders the simulation result can be extended to the dependency pair method for relative termination, introduced by Iborra et al. This result allows us to improve applicability of their dependency pair method. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Teppei Saito and Nao Hirokawa 2024 Is Part Of LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2024.13 urn:nbn:de:0030-drops-203423 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.13 eng https://creativecommons.org/licenses/by/4.0/legalcode