Matching with Regular Constraints

Kutsia, Temur; Marin, Mircea

doi:10.1007/11591191_16

Cited by 15 publications

(8 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, we deal not only with matching, but also with full-scale unification. Other work related to REOS matching is described in Kutsia and Marin (2005a, 2005b) , where some variables in matching are constrained by regular hedge languages.…”

Section: Introductionmentioning

confidence: 99%

Regular expression order-sorted unification and matching

Kutsia

Marin

2015

Journal of Symbolic Computation

Self Cite

View full text Add to dashboard Cite

We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g., order-sorted unification for ranked terms, sequence unification, and word unification with regular constraints. Decidability of REOS unification implies that sequence unification with regular hedge language constraints is decidable, generalizing the decidability result of word unification with regular constraints to terms. A sort weakening algorithm helps to construct a minimal complete set of REOS unifiers from the solutions of sequence unification problems. Moreover, we design a complete algorithm for REOS matching, and show that this problem is NP-complete and the corresponding counting problem is #P-complete.

show abstract

Section: Introductionmentioning

confidence: 99%

Regular expression order-sorted unification and matching

Kutsia

Marin

2015

Journal of Symbolic Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Similarly, the term c_X(f_Y(a)) matches the term f(a,g(a)) with the matchers {c_X →f(hole,g(a)),f_Y →f} and {c_X →f(a,g(hole)),f_Y →g}. An algorithm to solve matching problems in the described language has been introduced in [17].…”

Section: Introductionmentioning

confidence: 99%

A Rule-Based Approach to XML Processing and Web Reasoning

Coelho

Dundua

Florido

et al. 2010

Web Reasoning and Rule Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Combining sequence and context variables in a single framework and equipping it with regular constraint solving methods makes the framework more flexible, with many potential applications (Kutsia and Marin, 2005;Marin and Kutsia, 2006).…”

Section: Introductionmentioning

confidence: 99%

On the relation between Context and Sequence Unification

Kutsia¹,

Levy²,

Villaret³

2010

Journal of Symbolic Computation

Self Cite

View full text Add to dashboard Cite

Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence variables, and seems to be appealing for information extraction in XML documents, program transformation, knowledge representation, and rule-based programming. It is decidable. Context Unification deals with the same problem for ranked terms involving context variables, and has applications in computational linguistics and program transformation. Its decidability is a long-standing open question.In this work we study a relation between these two problems. We introduce a variant (restriction) of Context Unification, called Left-Hole Context Unification (LHCU), to which Sequence Unification is P-reduced: We define a partial currying procedure to translate sequence unification problems into left-hole context unification problems, and prove soundness of the translation. Furthermore, a precise characterization of the shape of the unifiers allows us to easily reduce Left-Hole Context Unification to (the decidable problem of) Word Unification with Regular Constraints, obtaining then a new decidability proof for Sequence Unification. Finally, we define an extension of Sequence Unification (ESU) and, closing the circle, prove the inter P-reducibility of LHCU and ESU.

show abstract

Matching with Regular Constraints

Cited by 15 publications

References 31 publications

Regular expression order-sorted unification and matching

Regular expression order-sorted unification and matching

A Rule-Based Approach to XML Processing and Web Reasoning

On the relation between Context and Sequence Unification

Contact Info

Product

Resources

About