Mostra el registre d'ítem simple
Unification and matching on compressed terms
dc.contributor.author | Gascón Caro, Adrià |
dc.contributor.author | Godoy Balil, Guillem |
dc.contributor.author | Schmidt-Schauß, Manfred |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2011-09-26T21:28:56Z |
dc.date.available | 2011-09-26T21:28:56Z |
dc.date.created | 2011-07-29 |
dc.date.issued | 2011-07-29 |
dc.identifier.citation | 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. |
dc.identifier.issn | 1529-3785 |
dc.identifier.uri | http://hdl.handle.net/2117/13343 |
dc.description.abstract | 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 result of an investigation on term unification and matching when the terms given as input are represented using different compression mechanisms for terms such as dags and singleton tree grammars. We describe a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. For the same problem, NP-completeness is obtained when the terms are represented using the more general formalism of singleton tree grammars. For first-order unification and matching polynomial time algorithms are presented, each of them improving previous results for those problems. |
dc.format.extent | 42 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Lambda calculus |
dc.subject.lcsh | Singleton tree grammars |
dc.subject.lcsh | Algorithms |
dc.title | Unification and matching on compressed terms |
dc.type | Article |
dc.subject.lemac | Càlcul lambda |
dc.subject.lemac | Llenguatges formals |
dc.subject.lemac | Algorismes |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1145/1970398.1970402 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://dl.acm.org/citation.cfm?doid=1970398.1970402 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 5947340 |
dc.description.version | Postprint (published version) |
local.citation.author | Gascon, A.; Godoy, G.; Schmidt-Schauß, M. |
local.citation.publicationName | ACM transactions on computational logic |
local.citation.volume | 12 |
local.citation.number | 4 |
local.citation.startingPage | 1 |
local.citation.endingPage | 42 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [274]