LIPIcs.RTA.2012.149.pdf
- Filesize: 0.53 MB
- 16 pages
Document
One-context Unification with STG-Compressed Terms is in NP
Authors
-
Part of:
Volume:
23rd International Conference on Rewriting Techniques and Applications (RTA'12) (RTA 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2012-05-29
Cite AsGet BibTex
Carles Creus, Adria Gascon, and Guillem Godoy. One-context Unification with STG-Compressed Terms is in NP. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 149-164, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.RTA.2012.149
https://doi.org/10.4230/LIPIcs.RTA.2012.149
Abstract
One-context unification is an extension of first-order term unification in which a variable of arity one standing for a context
may occur in the input terms. This problem arises in areas like
program analysis, term rewriting and XML processing and is known to be
solvable in nondeterministic polynomial time. We prove that this problem can be solved in nondeterministic polynomial time also when the input is compressed using Singleton Tree Grammars (STG's).
STG's are a grammar-based compression method for terms that generalizes the directed acyclic graph representation. They have been recently considered as an efficient in-memory representation for large terms, since several operations on terms can be performed efficiently on their STG representation without a prior decompression.
Keywords
- Term Unification
- Compression
- Grammars
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads