Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

LPAR
2005
Springer

favoriteEmaildiscussreport

76views Automated Reasoning» more LPAR 2005»

Matching with Regular Constraints

13 years 10 months ago

Matching with Regular Constraints

Download www.risc.jku.at

We describe a sound, terminating, and complete matching algorithm for terms built over ﬂexible 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.

Temur Kutsia, Mircea Marin

Real-time Traffic

Arity Function Symbols | Complete Matching Algorithm | LPAR 2005 | Sequence Variables |

claim paper

Related Content

» Regular Expression Matching for Reconfigurable Constraint Repetition Inspection

» Regular Expressions with Numerical Constraints and Automata with Counters

» Application of the motion vector constraint to the regularized enhancement of compressed v...

» Efficient solution of systems of orientation constraints

» Regular Expression Matching in Reconfigurable Hardware

» A Region Based Image Matching Method with Regularized SAR Model

» A decision procedure for subset constraints over regular languages

» Optimization Properties for Classes of Conjunctive Regular Path Queries

» On the Complexity of Linear Prediction Risk Bounds Margin Bounds and Regularization

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	LPAR
Authors	Temur Kutsia, Mircea Marin

Comments (0)