Decidability and Complexity of Finitely Closable Linear Equational Theories

Authors:
Christopher Lynch;Barbara Morawska
Affiliations:
-;-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 3
Cited 2

Term rewriting and all that

Term rewriting and all that
Goal-Directed E-Unification

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Undecidable Properties of Syntactic Theories

RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications

Complexity of Linear Standard Theories

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Goal-Directed E-Unification

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a subclass of the class of linear equational theories, called finitely closable linear theories. We consider unification problems with no repeated variables.We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic finitely closable linear theories.