文章基本信息

标题：One-context Unification with STG-Compressed Terms is in NP
本地全文：下载
作者：Carles Creus ; Adria Gascon ; Guillem Godoy 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2012
卷号：15
页码：149-164
DOI：10.4230/LIPIcs.RTA.2012.149
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Term Unification; Compression; Grammars