Unification and matching on compressed terms

ACM Transactions on Computational Logic

Volumn 12, Issue 4, 2011, Pages

  GascóN, Adriá ^a   Godoy, Guillem ^a   Schmidt Schauss, Manfred ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Context matching; Singleton tree grammars; Term unification

Indexed keywords

COMPRESSION MECHANISM; CONTEXT MATCHING; DIRECTED ACYCLIC GRAPHS; FIRST-ORDER; GRAMMAR-BASED COMPRESSION; LINEAR SPACES; MATCHING POLYNOMIAL; NP-COMPLETENESS; POLYNOMIAL-TIME ALGORITHMS; SINGLETON TREE GRAMMARS; TERM REPRESENTATION; TERM UNIFICATION; TREE GRAMMARS;

ALGORITHMS; DATA COMPRESSION; POLYNOMIAL APPROXIMATION;

PLANT EXTRACTS;

EID: 80051938966     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1970398.1970402     Document Type: Article

References (47)

1. BAADER, F. AND SIEKMANN, J. 1994. Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. Gabbay, C. Hogger, and J. Robinson, Eds., Oxford University Press, Oxford, U.K., 41-125.
2. BAADER, F. AND SNYDER, W. 2001. Unification theory. In Handbook of Automated Reasoning, J. A. Robinson and A.Voronkov, Eds., Elsevier and MIT Press, Amsterdam, The Netherlands, and Cambridge, MA, 445-532.
3. BENANAV, D., KAPUR, D., AND NARENDRAN, P. 1985. Complexity of matching problems. In Proceedings of the International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 202. Springer, Berlin, Germany, 417-429.
4. BERGLUND, A., BOAG, S., CHAMBERLIN, D., FERNáNDEZ, M. F., KAY, M., ROBIE, J., AND SIMÉON, J., EDS. 2007. XML Path Language (XPath) Version 2.0. W3C. http://www.w3.org/TR/2007/REC-xpath20-20070123/.
5. BERMAN, P.,KARPINSKI, M., LARMORE, L. L., PLANDOWSKI, W., AND RYTTER, W. 2002. On the complexity of pattern matching for highly compressed two-dimensional texts. J. Comp. Syst. Sci. 65, 2, 332-350. (Pubitemid 41161963)
6. BUSATTO, G., LOHREY, M., AND MANETH, S. 2005. Efficient memory representation of XML documents. In Proceedings of the International Conference on Database Programming Languages. Lecture Notes in Computer Science, vol. 3774. Springer, Berlin, Germany, 199-216. (Pubitemid 43943738)
7. BUSATTO, G., LOHREY, M., AND MANETH, S. 2008. Efficient memory representation of XML document trees. Inform. Syst. 33, 4-5, 456-474.
8. CHENEY, J. R. 1998. First-order term compression: Techniques and applications. Ph.D. thesis.
9. COMON, H., DAUCHET, M., GILLERON, R., JACQUEMARD, F., LUGIEZ, D., TISON, S., AND TOMMASI, M. 1997. Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata.
10. DOWNEY, P. J., SETHI, R., AND TARJAN, R. E. 1980. Variations on the common subexpression problem. J. ACM 27, 4, 758-771.
11. GASCóN, A., GODOY, G., AND SCHMIDT-SCHAUSS, M. 2008. Context matching for compressed terms. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science. 93-102. http://www.lsi.upc.edu/ggodoy/ publications.html.
12. GASCóN, A., GODOY, G., AND SCHMIDT-SCHAUSS, M. 2009. Unification with singleton tree grammars. In Proceedings of the International Conference on Rewriting Techniques and Applications. Springer, Berlin, Germany, 365-379.
13. GASCóN, A.,GODOY, G.,SCHMIDT-SCHAUSS,M., AND TIWARI, A. 2010. Context unificationwith one context variable. J. Symbol. Computat. 45, 2, 173-193.
14. GASIENIEC, L., KARPINSKI, M., PLANDOWSKI, W., AND RYTTER, W. 1996. Randomized efficient algorithms for compressed strings: The finger-print approach (extended abstract). In Proceedings of the 7th Annual Symposium on Combinational Pattern Matching. Lecture Notes in Computer Science, vol. 1075. Springer, Berlin, Germany, 39-49. (Pubitemid 126073707)
15. GENEST, B. AND MUSCHOLL, A. 2002. Pattern matching and membership for hierarchical message sequence charts. In Proceedings of the Latin American Symposium on Theoretical Informatics. Springer-Verlag, Berlin, Germany, 326-340.
16. GOTTLOB, G., KOCH, C., AND SCHULZ, K. U. 2006. Conjunctive queries over trees. J. ACM 53, 2, 238-272.
17. GRAF, P. 1995. Substitution tree indexing. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 914. Springer, Berlin, Germany, 117-131.
18. GRAF, P. 1996. Term indexing. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 1053. Springer, Berlin, Germany, 117-131.
19. GULWANI, S. AND TIWARI,A. 2007. Computing procedure summaries for interprocedural analysis. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science, vol. 4421. Springer, Berlin, Germany, 253-267. (Pubitemid 350259496)
20. HIRAO, M., SHINOHARA, A., TAKEDA, M., AND ARIKAWA, S. 2000. Fully compressed pattern matching algorithm for balanced straight-line programs. In Proceedings of the International Symposium on String Processing and Informational Retrieval '00. IEEE Computer Society Press, Los Alamitos, CA, 132.
21. KARPINSKI, M., PLANDOWSKI, W., AND RYTTER, W. 1996. Efficient algorithms for Lempel-Ziv encoding. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory. Springer-Verlag, Berlin, Germany, 392-403. (Pubitemid 126091945)
22. KARPINSKI, M., RYTTER, W., AND SHINOHARA, A. 1995. Pattern-matching for strings with short description. In Proceedings of the Annual Symposium on Combinational Pattern Matching. Springer-Verlag, Berlin, Germany, 205-214.
23. LASOTA, S. AND RYTTER, W. 2006. Faster algorithm for bisimulation equivalence of normed contextfree processes. In Proceedings of the Symposium on Mathematical Foundation of Computer Science. Lecture Notes in Computer Science, vol. 4162. Springer-Verlag, Berlin, Germany, 646-657. (Pubitemid 44577952)
24. LEVY, J., SCHMIDT-SCHAUSS, M., AND VILLARET, M. 2004. Monadic second-order unification is NP-complete. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 3091. Springer, Berlin, Germany, 55-69.
25. LEVY, J., SCHMIDT-SCHAUSS, M., AND VILLARET, M. 2006a. Bounded second-order unification is NP-complete. In Proceedings of the International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 4098. Springer, Berlin, Germany, 400-414. (Pubitemid 44502682)
26. LEVY, J., SCHMIDT-SCHAUSS, M., AND VILLARET, M. 2006b. Stratified context unification is NP-complete. In Proceedings of the 3rd International Joint Conference on Automated Reasoning. Lecture Notes in Computer Science, vol. 4130. Springer, Berlin, Germany, 82-96. (Pubitemid 44532664)
27. LEVY, J., SCHMIDT-SCHAUSS, M., AND VILLARET, M. 2008. The complexity of monadic second-order unification. SIAM J. Comp. 38, 3, 1113-1140.
28. LEVY, J., SCHMIDT-SCHAUSS, M., AND VILLARET, M. 2010. On the complexity of bounded second-order unification and stratified context unification. J. Alg. Cogn. Inform. Logic. To appear.
29. LIFSHITS, Y. 2007. Processing compressed texts: A tractability border. In Proceedings of the Annual Symposium on Combinational Pattern Matching. 228-240.
30. LOHREY, M. 2006. Word problems and membership problems on compressed words. SIAM J. Comp. 35, 5, 1210-1240. (Pubitemid 44599924)
31. LOHREY, M. AND MANETH, S. 2005. The complexity of tree automata and XPath on grammar-compressed trees. In Proceedings of the 10th International Conference on Implemantation and Application of Automate.
32. LOHREY, M.,MANETH, S., AND SCHMIDT-SCHAUSS, M. 2009. Parameter reduction in grammar-compressed trees. In Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, vol. 5504. Springer, Berlin, Germany, 212-226.
33. MANETH, S.,MIHAYLOV, N., AND SAKR, S. 2008. XML tree structure compression. In Proceedings of the International Conference on Database and Expert Systems Application. 243-247.
34. MARTELLI, A. AND MONTANARI, U. 1982. An efficient unification algorithm. ACM Trans. Programs Lang. Syst. 4, 2, 258-282.
35. MIYAZAKI, M., SHINOHARA, A., AND TAKEDA, M. 1997. An improved pattern matching algorithm for strings in terms of straight-line programs. In Proceedings of the 8th Annual Symposium on Combinational Pattern Matching. 1264 Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 1-11. (Pubitemid 127097464)
36. NIEHREN, J., PINKAL, M., AND RUHRBERG, P. 1997. A uniform approach to underspecification and parallelism. In Proceedings of the 35thMeeting of the Association of Computational Linguistics.Madrid, Spain, 410-417.
37. PATERSON, M. S. AND WEGMAN, M. N. 1978. Linear unification. J. Comp. Syst. Sci. 16, 158-167.
38. PLANDOWSKI, W. 1994. Testing equivalence of morphisms in context-free languages. In Proceedings of the 2nd Annual European Symposium on Algorithms, J. van Leeuwen, Ed., Lecture Notes in Computer Science, vol. 855. Springer, Berlin, Germany, 460-470.
39. PLANDOWSKI,W. 1995. The complexity of the morphism equivalence problem for context-free languages. Ph.D. dissertation. Department of Mathematics, Informatics and Mechanics, Warsaw University, Warsaw, Poland.
40. PLANDOWSKI, W. AND RYTTER, W. 1999. Complexity of language recognition problems for compressed words. In Jewels are Forever. Springer, Berlin, Germany, 262-272.
41. ROBINSON, J. 1965. A machine oriented logic based on the resolution principle. J. ACM 12, 1, 23-41.
42. SCHMIDT-SCHAUSS, M. 2005. Polynomial equality testing for terms with shared substructures. Frank rep. 21.
43. Institut für Informatik, FB Informatik und Mathematik, J W. Goethe-Universität Frankfurt am Main, Germany.
44. SCHMIDT-SCHAUSS, M. AND SCHULZ, K. U. 1998. On the exponent of periodicity of minimal solutions of context equations. In Proceedings of the 9th International Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 1379. Springer, Berlin, Germany, 61-75. (Pubitemid 128054445)
45. SCHMIDT-SCHAUSS, M. AND SCHULZ, K. U. 2002. Solvability of context equations with two context variables is decidable. J. Symb. Comp. 33, 1, 77-122.
46. SCHMIDT-SCHAUSS, M. AND STUBER, J. 2004. On the complexity of linear and stratified context matching problems. Theor. Comp. Syst. 37, 717-740. (Pubitemid 40003327)
47. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theor. 23, 3, 337-343.