One-context unification with STG-compressed terms is in NP

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 15, Issue , 2012, Pages 149-164

  Creus, Carles ^a   Gascón, Adrià ^a   Godoy, Guillem ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Compression; Grammars; Term unification

Indexed keywords

DIRECTED ACYCLIC GRAPH (DAG); GRAMMAR-BASED COMPRESSION; GRAMMARS; NONDETERMINISTIC POLYNOMIAL; PROGRAM ANALYSIS; TERM REWRITING; TERM UNIFICATION; XML PROCESSING;

COMPACTION; DATA COMPRESSION;

POLYNOMIAL APPROXIMATION;

EID: 84880193928     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.RTA.2012.149     Document Type: Conference Paper

References (19)

1. F. Baader and W. Snyder. Unification theory. In Handbook of Automated Reasoning, pages 445-532. Elsevier and MIT Press, 2001.
2. F. Bry and S. Schaffert. Towards a declarative query and transformation language for xml and semistructured data: Simulation unification. In ICLP, pages 255-270, 2002.
3. G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML document trees. Information Systems, 33(4-5):456-474, 2008.
4. K. Erk and J. Niehren. Dominance constraints in stratified context unification. Information Processing Letters, 101(4):141-147, 2007.
5. A. Gascón, G. Godoy, and M. Schmidt-Schauß. Unification and matching on compressed terms. ACM Transactions on Computational Logic, 12(4):26, 2011.
6. A. Gascón, G. Godoy, M. Schmidt-Schauß, and A. Tiwari. Context unification with one context variable. Journal of Symbolic Computation, 45(2):173-193, 2010.
7. A. Gascón, S. Maneth, and L. Ramos. First-order unification on compressed terms. In RTA, pages 51-60, 2011.
8. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
9. S. Gulwani and A. Tiwari. Computing procedure summaries for interprocedural analysis. In ESOP, pages 253-267, 2007.
10. J. Levy, J. Niehren, and M. Villaret. Well-nested context unification. In CADE, pages 149-163, 2005.
11. J. Levy, M. Schmidt-Schauß, and M. Villaret. The complexity of monadic second-order unification. SIAM Journal on Computing, 38(3):1113-1140, 2008.
12. J. Levy, M. Schmidt-Schauß, and M. Villaret. On the complexity of bounded second-order unification and stratified context unification. Logic Journal of the IGPL, 19(6):763-789, 2011.
13. Y. Lifshits. Processing compressed texts: A tractability border. In CPM, pages 228-240, 2007.
14. M. Lohrey and S. Maneth. The complexity of tree automata and XPath on grammarcompressed trees. Theoretical Computer Science, 363(2):196-210, 2006.
15. M. Lohrey, S. Maneth, and R. Mennicke. Tree structure compression with RePair. In DCC, pages 353-362, 2011.
16. M. Lohrey, S. Maneth, and M. Schmidt-Schauß. Parameter reduction in grammarcompressed trees. In FOSSACS, pages 212-226, 2009.
17. W. Plandowski. Testing equivalence of morphisms on context-free languages. In ESA, pages 460-470, 1994.
18. K. Sadakane and G. Navarro. Fully-functional succinct trees. In SODA, pages 134-149, 2010.
19. M. Schmidt-Schauß. Pattern matching of compressed terms and contexts and polynomial rewriting. Frank report 43, Institut für Informatik. Goethe-Universität Frankfurt am Main, February 2011.