Some Notes on Basic Syntactic Mutation

11 pages•Published: July 28, 2014

Kimberly Gero, Chris Bouchard and Paliath Narendran

Abstract

Unification modulo convergent term rewrite systems is an important research area with many applications. In their seminal paper Lynch and Morawska gave three conditions on rewrite systems that guarantee that unifiability can be checked in polynomial time (P). We show that these conditions are tight, in the sense that relaxing any one of them will "upset the applecart," giving rise to unification problems that are not in P (unless P = NP). We also investigate a related decision problem: we show the undecidability of subterm-collapse for the restricted term rewriting systems that we are considering.

Keyphrases: equational unification, subterm collapse, term rewriting, term rewriting systems, unification modulo convergent term rewrite systems

In: Santiago Escobar, Konstantin Korovin and Vladimir Rybakov (editors). UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, vol 24, pages 17-27.

Links:	https://easychair.org/publications/paper/PmL
	https://doi.org/10.29007/sdp1

BibTeX entry

@inproceedings{UNIF2012:Some_Notes_Basic_Syntactic,
  author    = {Kimberly Gero and Chris Bouchard and Paliath Narendran},
  title     = {Some Notes on Basic Syntactic Mutation},
  booktitle = {UNIF 2012 Post-Worskhop Proceedings. The 26th International  Workshop on Unification},
  editor    = {Santiago Escobar and Konstantin Korovin and Vladimir Rybakov},
  series    = {EPiC Series in Computing},
  volume    = {24},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/PmL},
  doi       = {10.29007/sdp1},
  pages     = {17-27},
  year      = {2014}}

Download PDF Open PDF in browser