Skip to main content
Conference Proceedings

A decidable case of the semi-unification problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 520 LNCS 318-327
DOI: 10.1007/3-540-54345-7_75
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The semi-unification problem has recently been shown to be undecidable [8]. We present a new subclass of decidable semi-unification problems, properly containing those over monadic languages. In our ‘quasi-monadic’ problems, function symbols may be of arity > 1, but only terms with at most one free variable are admitted.

Cite

CITATION STYLE

APA

Leiß, H., & Henglein, F. (1991). A decidable case of the semi-unification problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 520 LNCS, pp. 318–327). Springer Verlag. https://doi.org/10.1007/3-540-54345-7_75

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