First-order unification on compressed terms

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 10, Issue , 2011, Pages 51-60

  Gascón, Adrià ^a   Maneth, Sebastian ^b   Ramos, Lander ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED SUBGRAPHS; EQUIVALENCE CHECKING; RANDOMIZED ALGORITHMS; RUNNING TIME; TREE ALGORITHMS; TREE GRAMMARS; TYPECHECKING; UNIFICATION ALGORITHMS;

ALGORITHMS;

FORESTRY;

ALGORITHMS; EXPERIMENTATION; FORESTRY;

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

References (21)

1. F. Baader and J.H. Siekmann. Unification theory. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 2, pages 41-125. Oxford Univ. Press, 1994.
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. P. Buneman, M. Grohe, and C. Koch. Path queries on compressed XML. In VLDB, pages 141-152, 2003.
4. G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML document trees. Inf. Syst., 33:456-474, 2008.
5. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The smallest grammar problem. IEEE Transactions on Information Theory, 51(7):2554- 2576, 2005.
6. J. Coelho and M. Florido. XCentric: logic programming for XML processing. In WIDM, pages 1-8, 2007.
7. J. Corbin and M. Bidoit. A rehabilitation of Robinson's unification algorithm. In IFIP Congress, pages 909-914, 1983.
8. D. K. Fisher and S. Maneth. Structural selectivity estimation for XML documents. In ICDE, pages 626-635, 2007.
9. A. Gascón, G. Godoy, and M. Schmidt-Schauß. Unification with singleton tree grammars. In RTA, pages 365-379, 2009.
10. A. Gascón, G. Godoy, and M. Schmidt-Schauß. Unification and matching on compressed terms. CoRR, abs/1003.1632, 2010.
11. T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In AISC, pages 290-304, 2002.
12. J. Levy, M. Schmidt-Schauß, and M. Villaret. The complexity of monadic second-order unification. SIAM J. Comput., 38:1113-1140, 2008.
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. Theor. Comput. Sci., 363(2):196-210, 2006.
15. M. Lohrey, S. Maneth, and R. Mennicke. Tree structure compression with RePair. CoRR, abs/1007.5406, 2010. Short version to appear as paper in Proc. DCC'2011.
16. M. Lohrey, S. Maneth, and M. Schmidt-Schauß. Parameter reduction in grammarcompressed trees. In FOSSACS, pages 212-226, 2009.
17. S. Maneth and T. Sebastian. Fast and tiny structural self-indexes for XML. CoRR, abs/1012.5696, 2010.
18. J.A. Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12:23- 41, 1965.
19. W. Rytter. Grammar compression, LZ-encodings, and string algorithms with implicit input. In Proc. ICALP, volume 3142 of LNCS, pages 15-27, 2004.
20. K. Sadakane and G. Navarro. Fully-functional succinct trees. In SODA, pages 134-149, 2010.
21. M. Schmidt-Schauß and G. Schnitger. Fast equality test for straight-line compressed strings. unpublished manuscript, October 2010.