Unification with singleton tree grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5595 LNCS, Issue , 2009, Pages 365-379

  Gascón, Adrià ^a   Godoy, Guillem ^a   Schmidt Schauß, Manfred ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED DEDUCTION; COMPILER DESIGN; DEDUCTIVE DATABASE; FIRST-ORDER; GRAMMAR-BASED COMPRESSION; POLYNOMIAL SPACE; POLYNOMIAL TIME COMPUTABILITY; POLYNOMIAL-TIME; PREORDERS; TERM UNIFICATION; TREE GRAMMARS;

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; DATA COMPRESSION; FUNCTIONAL PROGRAMMING; INFORMATION SERVICES; LOGIC PROGRAMMING; MACHINE DESIGN;

POLYNOMIAL APPROXIMATION;

EID: 70350625452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02348-4_26     Document Type: Conference Paper

References (23)

1. Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 199-216. Springer, Heidelberg (2005)
2. Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445-532. Elsevier/MIT Press (2001)
3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), http://www.grappa.univ-lille3.fr/tata (release 1.10.2002)
4. Gascón, A., Godoy, G., Schmidt-Schauß, M.: Context matching for compressed terms. In: 23rd IEEE LICS, pp. 93-102 (2008), http://www.lsi.upc.edu/~ggodoy/publications.html
5. Gascón, A., Godoy, G., Schmidt-Schauß, M., Tiwari, A.: Context Unification with One Context Variable (to be published) (2008)
6. Genest, B., Muscholl, A.: Pattern matching and membership for hierarchical message sequence charts. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 326-340. Springer, Heidelberg (2002)
7. Hirao, M., Shinohara, A., Takeda, M., Arikawa, S.: Fully compressed pattern matching algorithm for balanced straight-line programs. In: SPIRE 2000, p. 132. IEEE Computer Society Press, Washington (2000)
8. Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel-Ziv encoding. In: Proc. 4th Scandinavian Workshop on Algorithm Theory, pp. 392-403. Springer, Heidelberg (1996)
9. Karpinski, M., Rytter, W., Shinohara, A.: Pattern-matching for strings with short description. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 205-214. Springer, Heidelberg (1995)
10. Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228-240. Springer, Heidelberg (2007)
11. Lohrey, M., Maneth, S.: The complexity of tree automata and XPath on grammar-compressed trees. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845. Springer, Heidelberg (2006)
12. Lohrey, M., Maneth, S., Schmidt-Schauß, M.: Parameter reduction in grammar-compressed trees. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 212-226. Springer, Heidelberg (2009)
13. Lohrey, M.: Word problems and membership problems on compressed words. SIAM Journal on Computing 35(5), 1210-1240 (2006)
14. Lasota, S., Rytter, W.: Faster algorithm for bisimulation equivalence of normed context-free processes. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 646-657. Springer, Heidelberg (2006
15. Levy, J., Schmidt-Schauß, M., Villaret, M.: Monadic second-order unification is NP-complete. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 55-69. Springer, Heidelberg (2004)
16. Levy, J., Schmidt-Schauß, M., Villaret, M.: Bounded second-order unification is NP-complete. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 400-414. Springer, Heidelberg (2006)
17. Levy, J., Schmidt-Schauß, M., Villaret, M.: Stratified context unification is NP-complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol. 4130, pp. 82-96. Springer, Heidelberg (2006)
18. Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Trans. on programming languages and systems 4(2), 258-282 (1982
19. Maneth, S., Mihaylov, N., Sakr, S.: XML tree structure compression. DEXA, 243-247 (2008
20. Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 1-11. Springer, Heidelberg (1997)
21. Plandowski, W.: The Complexity of the Morphism Equivalence Problem for Context-Free Languages. PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University (1995)
22. Alan Robinson, J.: A machine oriented logic based on the resolution principle. J. of the ACM 12(1), 23-41 (1965)
23. Schmidt-Schauß, M.: Polynomial equality testing for terms with shared substructures. Frank report 21, FB Informatik und Mathematik. Goethe-Univ. Frankfurt (November 2005)