Sequence unification through currying

Authors:
Temur Kutsia;Jordi Levy;Mateu Villaret
Affiliations:
Research Institute for Symbolic Computation, Johannes Kepler University of Linz, Linz, Austria;Artificial Intelligence Research Institute, Spanish Council for Scientific Research, Barcelona, Spain;Departament d'Informàtica i Matemàtica Aplicada, Universitat de Girona, Girona, Spain
Venue:
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Year:
2007

Citing 14
Cited 2

Minimal and complete word unification

Journal of the ACM (JACM)
The MVL theorem proving system

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
A Tight, Practical Integration of Relations and Functions

A Tight, Practical Integration of Relations and Functions
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization

IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Currying Second-Order Unification Problems

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification

RTA '96 Proceedings of the 7th 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
Satisfiability of Word Equations with Constants is in PSPACE

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The Mathematica Book

The Mathematica Book
A uniform approach to underspecification and parallelism

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Solving equations with sequence variables and sequence functions

Journal of Symbolic Computation
Matching with regular constraints

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
VeriFLog: a constraint logic programming approach to verification of website content

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Well-nested context unification

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

On the relation between Context and Sequence Unification

Journal of Symbolic Computation
Anti-unification for Unranked Terms and Hedges

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequence variables play an interesting role in unification and matching when dealing with terms in an unranked signature. Sequence Unification generalizes Word Unification and seems to be appealing for information extraction in XML documents, program transformation, and rule-based programming. In this work we study a relation between Sequence Unification and another generalization of Word Unification: Context Unification. We introduce a variant of Context Unification, called Left-Hole Context Unification that serves us to reduce Sequence Unification to it: 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 decidability proof for an extension of Sequence Unification.