License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2011.51
URN: urn:nbn:de:0030-drops-31263
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3126/
Go to the corresponding LIPIcs Volume Portal

Gascón, Adrià ; Maneth, Sebastian ; Ramos, Lander

First-Order Unification on Compressed Terms

pdf-format:
19.pdf (0.5 MB)

Abstract

Singleton Tree Grammars (STGs) have recently drawn considerable
attention. They generalize the sharing of subtrees known from DAGs to
sharing of connected subgraphs. This allows to obtain smaller
in-memory representations of trees than with DAGs. In the past years
some important tree algorithms were proved to perform efficiently
(without decompression) over STGs; e.g., type checking, equivalence
checking, and unification. We present a tool that implements an
extension of the unification algorithm for STGs. This algorithm makes
extensive use of equivalence checking. For the latter we implemented
two variants, the classical exact one and a recent randomized one. Our
experiments show that the randomized algorithm performs better. The
running times are also compared to those of unification over
uncompressed trees.

BibTeX - Entry

@InProceedings{gascn_et_al:LIPIcs:2011:3126,
  author =	{Adri{\`a} Gasc{\'o}n and Sebastian Maneth and Lander Ramos},
  title =	{{First-Order Unification on Compressed Terms}},
  booktitle =	{22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
  pages =	{51--60},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-30-9 },
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{10},
  editor =	{Manfred Schmidt-Schau{\ss}},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3126},
  URN =		{urn:nbn:de:0030-drops-31263},
  doi =		{10.4230/LIPIcs.RTA.2011.51},
  annote =	{Keywords: unification, matching, grammars, compression, STG, system C++}
}

Keywords: unification, matching, grammars, compression, STG, system C++
Collection: 22nd International Conference on Rewriting Techniques and Applications (RTA'11)
Issue Date: 2011
Date of publication: 26.04.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI