A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Context Matching for Compressed Terms
2008
Logic in Computer Science
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed representation. In this setting, term representation with dags, but also with the more general formalism of singleton tree grammars, are considered. 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
doi:10.1109/lics.2008.17
dblp:conf/lics/GasconGS08
fatcat:2q34ddds65gsbo3bjhib37qoua