Solving equations with sequence variables and sequence functions

Authors:
Temur Kutsia
Affiliations:
Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria
Venue:
Journal of Symbolic Computation
Year:
2007

Citing 14
Cited 5

Solving word equations

Journal of Symbolic Computation
Minimal and complete word unification

Journal of the ACM (JACM)
An introduction to Prolog III

Communications of the ACM
The MVL theorem proving system

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Word unification and transformation of generalized equations

Journal of Automated Reasoning
SET-VAR

Journal of Automated Reasoning
Unification in the union of disjoint equational theories: combining decision procedures

Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The Mathematica Book

The Mathematica Book
A Tight, Practical Integration of Relations and Functions

A Tight, Practical Integration of Relations and Functions
General A- and AX-Unification via Optimized

IWWERT '91 Proceedings of the Second International Workshop on Word Equations and Related Topics
E-Unification for Subsystems of S4

RTA '98 Proceedings of the 9th 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
Equational prover of theorema

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications

On the relation between Context and Sequence Unification

Journal of Symbolic Computation
Anti-patterns for rule-based languages

Journal of Symbolic Computation
Sequence unification through currying

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Sequence disunification and its application in collaborative schema construction

WISE'07 Proceedings of the 2007 international conference on Web information systems engineering
Anti-unification for Unranked Terms and Hedges

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variable can be instantiated by any finite sequence of terms. A sequence function abbreviates a finite sequence of functions all having the same argument lists. It is proved that solvability of systems of equations of this form is decidable. A new unification procedure that enumerates a complete almost minimal set of solutions is presented, together with variations for special cases. The procedure terminates if the solution set is finite. Applications in various areas of artificial intelligence, symbolic computation, and programming are discussed.