Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version)

Inspired by questions from program transformations, eight notions of isomorphisms between term rewriting systems are defined, analysed and classified. The notions include global isomorphisms where the renaming of variables and / or function symbols is the same for all term rewriting rules of the system, and local ones where a single renaming for every rule is used. The complexity of the underlying decision problems are analysed and either shown to be efficiently solvable or proved to be complete for the graph isomorphism complexity class.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2020

Sign-curing local Hamiltonians: termwise versus global stoquasticity and the use of Clifford transformations

We elucidate the distinction between global and termwise stoquasticity f...
research
02/26/2011

Back and Forth Between Rules and SE-Models (Extended Version)

Rules in logic programming encode information about mutual interdependen...
research
09/09/2019

On the Strong Equivalences for LPMLN Programs

LPMLN is a powerful knowledge representation and reasoning tool that com...
research
10/03/2022

Notions of Tensor Rank

Tensors, or multi-linear forms, are important objects in a variety of ar...
research
02/22/2019

On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems

In this paper, we show a new approach to transformations of an imperativ...
research
04/11/2013

From Constraints to Resolution Rules, Part II: chains, braids, confluence and T&E

In this Part II, we apply the general theory developed in Part I to a de...
research
05/28/2019

Confluence by Critical Pair Analysis Revisited (Extended Version)

We present two methods for proving confluence of left-linear term rewrit...

Please sign up or login with your details

Forgot password? Click here to reset