An Extension of Baaz's Algorithm to E-semi-unification with One Inequality
BibTeX
@MISC{Oliart_anextension,
author = {Alberto Oliart and Laboratorio Nacional and Informatica Avanzada A. C},
title = {An Extension of Baaz's Algorithm to E-semi-unification with One Inequality},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present a preliminary research report on the problem of nding procedures to solve some cases of the Uniform E-Semi- unication Problem, where E is a set of equations dening an equational theory. The problem in general is undecidable, but for certain theories, as is the case with E-Unication, there may be theories for which it is decidable. 1 Introduction The Semi-Unication problem has applications in areas of computer science like programming languages, computational linguistics, term rewriting, and automated deduction. Despite this, the body of knowledge on Semi-unication is not comparable to that of Unication, which has been for a long time an ongoing branch of study in computer science. The general problem of semi-unication (see below for denitions) has been shown to be undecidable, but there are a number of restrictions andor generalizations that can be shown to be decidable. In this paper we present an introduction and a preliminary research rep...
Citations
| 181 | Unification theory - Baader, Snyder - 2001 |
| 129 | Type inference with polymorphic recursion - Henglein - 1993 |
| 9 | Dimension Inference Under Polymorphic Recursion - Rittri - 1995 |
| 6 | The undecidability of the semi-uni cation problem - Kfoury, Tiuryn, et al. - 1993 |
| 3 | Semi-unification of two terms in Abelian groups - Rittri - 1994 |
| 1 | Note on the existenec of most general uni - Baaz - 1993 |
| 1 | A fast algorithm for semi-uni - Oliart, Snyder - 1998 |
| 1 | On a uni problem related to kreisel's conjecture. Commentationes Mathematicae Universitatis Carolinae - Pudlack - 1988 |
