Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Unification and matching on compressed terms

Autor
Gascon, A.; Godoy, G.; Schmidt-Schauß, M.
Tipus d'activitat
Article en revista
Revista
ACM transactions on computational logic
Data de publicació
2011-07-29
Volum
12
Número
4
Pàgina inicial
1
Pàgina final
42
DOI
https://doi.org/10.1145/1970398.1970402 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/13343 Obrir en finestra nova
URL
http://dl.acm.org/citation.cfm?doid=1970398.1970402 Obrir en finestra nova
Resum
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called singleton tree grammars (STGAs), have recently drawn considerable attention. Using STGs, terms of exponential size and height can be represented in linear space. Furthermore, the term representation by directed acyclic graphs (dags) can be efficiently simulated. The present article is the resu...
Citació
Gascon, A.; Godoy, G.; Schmidt-Schauß, M. Unification and matching on compressed terms. "ACM transactions on computational logic", 29 Juliol 2011, vol. 12, núm. 4, p. 1-42.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants