Matching with regular constraints

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

Volumn 3835 LNAI, Issue , 2005, Pages 215-229

  Kutsia, Temur ^a   Marin, Mircea ^b  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FORMAL LANGUAGES; FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION;

COMPLETE MATCHING ALGORITHM; REGULAR EXPRESSIONS; SEQUENCE VARIABLES;

ALGORITHMS;

EID: 33745446387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_16     Document Type: Conference Paper

References (42)

1. M. Alpuente, D. Ballis, and M. Falaschi. A rewriting-based framework for web sites verification. Electr. Notes on Theoretical Comp. Science, 124(1):41-61, 2005.
2. V. Benzaken, G. Castagna, and A. Frisch. CDuce: an XML-centric general-purpose language. In Froc, of ICFP'03, pages 51-63. ACM, 2003.
3. H. Boley. A Tight, Practical Integration of Relations and Functions, volume 1712 of LNAI. Springer, 1999.
4. A. Bonifati and S. Ceri. Comparative analysis of five XML query languages. ACM SIGMOD Record, 29(1):68-79, 2000.
5. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2): 197-213, 1993.
6. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets. Technical Report HKUST-TCSC-2001-05, Hong Kong University of Science and Technology, 2001.
7. F. Bry, Ch. Koch, T. Furche, S. Schaffert, L. Badea, and S. Berger. Querying the web reconsidered: Design principles for versatile web query languages. Int. J. Semantic Web Inf. Syst., 1(2):1-21, 2005.
8. F. Bry and S. Schaffert. Towards a declarative query and transformation language for XML and semistructured data: Simulation unification. In Proc. of ICLP, number 2401 in LNCS, Copenhagen, Denmark, 2002. Springer.
9. B. Buchberger and A. Craciun. Algorithm synthesis by Lazy Thinking: Examples and implementation in Theorema. Electr. Notes Theor. Comput. Sci., 93:24-59, 2004.
10. J. Carme, J. Niehren, and M. Tommasi. Querying unranked trees with stepwise tree automata. In V. van Oostrom, editor, Proc. of RTA '04, volume 3091 of LNCS, pages 105-118. Springer, 2004.
11. E. Chasseur and Y. Deville. Logic program schemas, constraints and semi-unification. In Proc. of LOPSTR'97, volume 1463 of LNCS, pages 69-89. Springer, 1998.
12. J. Clark and S. DeRose, editors. XML Path Language (XPath) Version 1.0. W3C, 1999. Available from: http://www.w3.org/TR/xpath/.
13. H. Comon. Completion of rewrite systems with membership constraints. Part I: Deduction rules. J. Symbolic Computation, 25(4):397-419, 1998.
14. H. Comon. Completion of rewrite systems with membership constraints. Part II: Constraint solving. J. Symbolic Computation, 25(4):421-453, 1998.
15. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available from: http://www.grappa.univ-lille3.fr/tata, 1997.
16. M. Prick, M. Grohe, and Ch. Koch. Query evaluation on compressed trees. In Proc. of LICS'03, pages 188-198. IEEE Computer Society, 2003.
17. A. Frisch and L. Cardelli. Greedy regular expression matching. In Proc. of ICALP'04, pages 618-629, 2004.
18. T. Furche, F. Bry, S. Schaffert, R. Orsini, I. Horroks, M. Kraus, and O. Bolzer. Survey over existing query and transformation languages. Available from: http://rewerse.net/deliverables/i4-d1.pdf, 2004.
19. V. Gapeyev and B. C. Pierce. Regular object types. In L. Cardelli, editor, Proc. of ECOOP'03, volume 2743 of LNCS, pages 151-175. Springer, 2003.
20. M. Ginsberg. The MVL theorem proving system. SIGART Bull., 2(3):57-60, 1991.
21. G. Gottlob and Ch. Koch. Monadic Datalog and the expressive power of languages for web information retrieval. J. ACM, 51(1):74-113, 2004.
22. G. Gottlob, Ch. Koch, and K. Schulz. Conjunctive queries over trees. In A. Deutsch, editor, Proc. of PODS'04, pages 189-200. ACM, 2004.
23. M. Hamana. Term rewriting with sequences. In: Proc. of the First Int. Theorema Workshop. Technical report 97-20, RISC, Johannes Kepler University, Linz, 1997.
24. H. Hosoya. Regular expression pattern matching-a simpler design. Manuscript, 2003.
25. H. Hosoya and B. Pierce. Regular expression pattern matching for XML. J. Functional Programming, 13(6):961-1004, 2003.
26. T. Kutsia. Solving and Proving in Equational Theories with Sequence Variables and Flexible Arity Symbols. PhD thesis, Johannes Kepler University, Linz, 2002.
27. T. Kutsia. Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In J. Calmet, B. Benhamou, O. Caprotti, L. Henocque, and V. Sorge, editors, Proc. of Joint AISC'2002 - Calculemus'2002 Conference, volume 2385 of LNAI, pages 290-304. Springer, 2002.
28. T. Kutsia. Solving equations involving sequence variables and sequence functions. In B. Buchberger and J. A. Campbell, editors, Proc. of AISC'04, volume 3249 of LNAI, pages 157-170. Springer, 2004.
29. T. Kutsia. Context sequence matching for XML. In M. Alpuente, S. Escobar, and M. Falaschi, editors, Proc. of WWV'05, pages 103-119, 2005. (Full version to appear in ENTCS).
30. T. Kutsia and M. Marin. Matching with regular constraints. Technical Report 05-05, RISC, Johannes Kepler University, Linz, 2005.
31. J. Levy and M. Villaret. Linear second-order unification and context unification with tree-regular constraints. In L. Bachmair, editor, Proc. of RTA '2000, volume 1833 of LNCS, pages 156-171. Springer, 2000.
32. D. Maier. Database desiderata for an XML query language. Available from: http://www.w3.org/TandS/QL/QL98/pp/maier.html, 1998.
33. M. Marin. Introducing pLog. Available from: http://www.score.is.tsukuba. ac.jp/~mmarin/RhoLog/, 2005.
34. M. Marin and D. Tepeneu. Programming with sequence variables: The Sequentica package. In Proc. of the 5th Int. Mathematica Symposium, pages 17-24, 2003.
35. M. Marin and T. Ida. Progress of ρLog, a rule-based programming system. In 7th Intl. Mathematica Symposium (IMS'05), Perth, Australia, 2005. To appear.
36. A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In Proc. of FSTTCS'98, volume 1530 of LNCS, pages 134-145. Springer, 1998.
37. F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633-674, 2002.
38. J. Niehren, L. Planque, J.-M. Talbot, and S. Tison. N-ary queries by tree automata. In Proc. of DBPL'05, 2005.
39. M. Schmidt-Schauß. A decision algorithm for stratified context unification. J. Logic and Computation, 12(6):929-953, 2002.
40. M. Schmidt-Schauß and K. U. Schulz. Solvability of context equations with two context variables is decidable. J. Symbolic Computation, 33(1):77-122, 2002.
41. M. Schmidt-Schauß and J. Stuber. On the complexity of linear and stratified context matching problems. Theory Comput. Systems, 37:717-740, 2004.
42. R. C. Sekar, I. V. Ramakrishnan, and A. Voronkov. Term indexing. In J. A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, pages 1853-1964. Elsevier and MIT Press, 2001.