Skip to main content
Conference Proceedings

Monadic simultaneous rigid E-unification and related problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1256 156-165
DOI: 10.1007/3-540-63165-8_173
13Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the monadic case of a decision problem know as simultaneous rigid E-unification. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.

Cite

CITATION STYLE

APA

Gurevich, Y., & Voronkov, A. (1997). Monadic simultaneous rigid E-unification and related problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 156–165). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_173

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free