Context Sequence Matching for XML

Authors:
Temur Kutsia
Affiliations:
Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 11
Cited 2

The MVL theorem proving system

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Completion of rewrite systems with membership constraints. Part I: deduction rules

Journal of Symbolic Computation - Special issue: order-sorted rewriting
Completion of rewrite systems with membership constraints. Part II: constraint solving

Journal of Symbolic Computation - Special issue: order-sorted rewriting
Comparative analysis of five XML query languages

ACM SIGMOD Record
Solvability of context equations with two context variable is decidable

Journal of Symbolic Computation
A Tight, Practical Integration of Relations and Functions

A Tight, Practical Integration of Relations and Functions
Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Computing simulations on finite and infinite graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Regular expression pattern matching for XML

Journal of Functional Programming

Flat matching

Journal of Symbolic Computation
Sequence disunification and its application in collaborative schema construction

WISE'07 Proceedings of the 2007 international conference on Web information systems engineering

Quantified Score

Hi-index	0.00

Visualization

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.