Matching with regular constraints

Authors:
Temur Kutsia;Mircea Marin
Affiliations:
Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 19
Cited 5

The MVL theorem proving system

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Regular expressions into finite automata

Theoretical Computer Science
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
Query automata over finite trees

Theoretical Computer Science
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
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Term indexing

Handbook of automated reasoning
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
CDuce: an XML-centric general-purpose language

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
Regular expression pattern matching for XML

Journal of Functional Programming
Conjunctive queries over trees

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
N-ary queries by tree automata

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages

On the relation between Context and Sequence Unification

Journal of Symbolic Computation
Sequence unification through currying

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Online constrained pattern detection over streams

FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
A rule-based approach to XML processing and web reasoning

RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Anti-unification for Unranked Terms and Hedges

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. Context and sequence variables allow matching to move in term trees to arbitrary depth and breadth, respectively. The values of variables can be constrained by regular expressions which are not necessarily linear. We describe heuristics for optimization, and discuss applications.