Context matching for compressed terms

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 93-102

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARSENIC COMPOUNDS; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; NUCLEAR PROPULSION; POLYNOMIALS;

CONTEXT MATCHING; FIRST ORDERS; LOGIC IN COMPUTER SCIENCE;

POLYNOMIAL APPROXIMATION;

EID: 51549092365     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.17     Document Type: Conference Paper

References (20)

1. F. Baader and J. Siekmann. Unification theory. In D. Gab-bay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, pages 41-125. Oxford University Press, 1994.
2. F. Baader and W. Snyder. Unification theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 8, pages 445-532. Elsevier Science and MIT Press, 2001.
3. A. Berglund, S. Boag, D. Chamberlin, M. F. Fernández, M. Kay, J. Robie, and J. Siméon, editors. XML Path Language (XPath) Version 2.0. W3C, 2007. http://www.w3.org/TR/2007/REC-xpath20-20070123/.
4. G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML documents. In Proc. of DBPL2005, volume 3774 of LNCS, pages 199-216, 2005.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release 1.10.2002.
6. G. Gottlob, C. Koch, and K. U. Schulz. Conjunctive queries over trees. J. ACM, 53(2):238-272, 2006.
7. S. Gulwani and A. Tiwari. Computing procedure summaries for interprocedural analysis. In Proc. ESOP 2007, volume 4421 of LNCS, pages 253-267. Springer, 2007.
8. J. Levy, M. Schmidt-SchauB, and M. Villaret. Monadic second-order unification is NP-complete. In Proc. 15th RTA, volume 3091 of LNCS, pages 55-69. Springer, 2004.
9. J. Levy, M. Schmidt-Schauβ, and M. Villaret. Monadic second-order unification is NP-complete. In Proc. 15th RTA, volume 3091 of LNCS, pages 55-69. Springer, 2004.
10. J. Levy, M. Schmidt-SchauB, and M. Villaret. Bounded second-order unification is NP-complete. In Proc. RTA-17, volume 4098 of LNCS, pages 400-414. Springer, 2006.
11. J. Levy, M. Schmidt-Schauβ, and M. Villaret. Stratified context unification is NP-complete. In Proc. Third IJCAR 2006, volume 4130 of LNCS, pages 82-96. Springer, 2006.
12. Y. Lifshits. Solving classical string problems on compressed texts. CoRR, abs/cs/0604058, 2006.
13. M. Lohrey. Word problems and membership problems on compressed words. SIAM Journal on Computing, 35(5):1210-1240, 2006.
14. J. Niehren, M. Pinkal, and P. Ruhrberg. A uniform approach to underspecification and parallelism. In Proc. of 35th ACL'97, pages 410-417, Madrid, Spain, 1997.
15. W. Plandowski. Testing equivalence of morphisms in context-free languages. In J. van Leeuwen, editor, Proc. 2nd ESA'94, volume 855 of LNCS, pages 460-470, 1994.
16. W. Plandowski. The Complexity of the Morphism Equivalence Problem for Context-Free Languages. PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University, 1995.
17. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In Jewels are Forever, pages 262-272. Springer, 1999.
18. M. Schmidt-Schauβ. Polynomial equality testing for terms with shared substructures. Frank report 21, Institut für In-formatik. FB Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, November 2005.
19. M. Schmidt-Schauβ and K. U. Schulz. Solvability of context equations with two context variables is decidable. J. Symb. Comput., 33(1):77-122, 2002.
20. M. Schmidt-Schauβ and J. Stuber. On the complexity of linear and stratified context matching problems. Theory of Computing Systems, 37:717-740, 2004.