This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 23rd Annual IEEE Symposium on Logic in Computer Science
Context Matching for Compressed Terms
June 24-June 27
ISBN: 978-0-7695-3183-0
ASCII Text
x 
 
Adria Gasc?, Guillem Godoy, Manfred Schmidt-Schauss, "Context Matching for Compressed Terms," Logic in Computer Science, Symposium on, pp. 93-102, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2008.17,
author = {Adria Gasc? and Guillem Godoy and Manfred Schmidt-Schauss},
title = {Context Matching for Compressed Terms},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2008},
issn = {1043-6871},
pages = {93-102},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2008.17},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Context Matching for Compressed Terms
SN - 1043-6871
SP93
EP102
A1 - Adria Gasc?,
A1 - Guillem Godoy,
A1 - Manfred Schmidt-Schauss,
PY - 2008
KW - context variables
KW - matching
KW - tree compression
KW - unification
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
This paper is an investigation of the matching problem for term equations s = t??where??s??contains context variables and first-order variables, and both terms??s??and??t??are given using some kind of compressed representation. The main result is a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. NP-completeness is obtained when the terms are represented using the more general formalism of singleton tree grammars. As an ingredient of this proof, we also show that the special case of first-order matching with singleton tree grammars is decidable in polynomial time.
Index Terms:
context variables, matching, tree compression, unification
Citation:
Adria Gasc?, Guillem Godoy, Manfred Schmidt-Schauss, "Context Matching for Compressed Terms," lics, pp.93-102, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008
Usage of this product signifies your acceptance of the Terms of Use.