Term equations involving individual and sequence variables, and individual and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A new unification procedure for solving such equations is presented. Decidability of unification is proved. Completeness and almost minimality of the procedure is shown. © Springer-Verlag 2004.
CITATION STYLE
Kutsia, T. (2004). Solving Equations Involving Sequence Variables and Sequence Functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3249, 157–170. https://doi.org/10.1007/978-3-540-30210-0_14
Mendeley helps you to discover research relevant for your work.