Abstract

Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-based language to query and transform XML, or to specify and verify web sites. Such a language would have advantages of both path-based and pattern-based languages. We develop a context sequence matching algorithm and its extension for regular expression matching, and prove their soundness, termination and completeness properties.

Citations

118	P.: Computing simulations on finite and infinite graphs - Henzinger, Henzinger, et al. - 1995
104	Regular expression pattern matching for XML - Hosoya, Pierce - 2002
81	Web Consortium (W3C). Extensible Markup Language (XML) 1.0 - Wide - 1998
77	S.: Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification - Bry, Schaert - 2002
73	Comparative analysis of five XML query languages - Bonifati, Ceri
63	Completion of rewrite systems with membership constraints - Comon - 1993
54	Database Desiderata for an XML Query Language - Maier - 1998
52	The Theorema Project: A Progress Report - Buchberger, Dupre, et al. - 2000
31	Algorithm Synthesis by Lazy Thinking: Examples and Implementation - Buchberger, Craciun
27	Unification with sequence variables and flexible arity symbols and its extension with pattern-terms - Kutsia - 2002
23	Solvability of context equations with two context variables is decidable - Schmidt-Schauß, Schulz - 1999
20	A Tight, Practical Integration of Relations and Functions - Boley - 1999
20	CLP(Flex): Constraint logic programming applied to XML processing - Coelho, Florido - 2004
19	A rewriting-based framework for web sites verification - Alpuente, Ballis, et al. - 2004
19	Solving and Proving in Equational Theories with Sequence Variables and Flexible Arity Symbols - Kutsia - 2002
15	A decision algorithm for stratified context unification - Schmidt-Schauß - 1999
15	The complexity of linear and stratified context matching problems - Schmidt-Schauß, Stuber - 2004
13	The MVL theorem proving system - Ginsberg - 1991
12	Linear second-order unification and context unification with tree-regular constraints - Levy, Villaret - 2000
11	Survey over Existing Query and Transformation Languages - Furche, Bry, et al. - 2004
9	Solving equations involving sequence variables and sequence functions - Kutsia - 2004
6	Term rewriting with sequences. In: Proc. of the First Int. Theorema Workshop - Hamana - 1997
3	Available from: http://www.w3.org/TR/xpath - Clark, DeRose, et al. - 1999
3	Introducing a rule-based programming system ρLog. Available from: http://www.score.is.tsukuba.ac.jp/~mmarin/RhoLog - Marin - 2004