When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2012.149
URN: urn:nbn:de:0030-drops-34902
Go to the corresponding LIPIcs Volume Portal

Creus, Carles ; Gascon, Adria ; Godoy, Guillem

One-context Unification with STG-Compressed Terms is in NP

13.pdf (0.5 MB)


One-context unification is an extension of first-order term unification in which a variable of arity one standing for a context may occur in the input terms. This problem arises in areas like program analysis, term rewriting and XML processing and is known to be solvable in nondeterministic polynomial time. We prove that this problem can be solved in nondeterministic polynomial time also when the input is compressed using Singleton Tree Grammars (STG's). STG's are a grammar-based compression method for terms that generalizes the directed acyclic graph representation. They have been recently considered as an efficient in-memory representation for large terms, since several operations on terms can be performed efficiently on their STG representation without a prior decompression.

BibTeX - Entry

  author =	{Carles Creus and Adria Gascon and Guillem Godoy},
  title =	{{One-context Unification with STG-Compressed Terms is in NP}},
  booktitle =	{23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
  pages =	{149--164},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-38-5},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{15},
  editor =	{Ashish Tiwari},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-34902},
  doi =		{},
  annote =	{Keywords: Term Unification, Compression, Grammars}

Keywords: Term Unification, Compression, Grammars
Seminar: 23rd International Conference on Rewriting Techniques and Applications (RTA'12)
Issue Date: 2012
Date of publication: 15.05.2012

DROPS-Home | Fulltext Search | Imprint Published by LZI