Title of article
The STO-problem is NP-hard
Author/Authors
Krzysztof R. Apt، نويسنده , , Peter van Emde Boas، نويسنده , , Angelo Welling، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
7
From page
489
To page
495
Abstract
A finite set of term equations E is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with E and ends with a failure due to occur-check. We prove here that the problem of deciding whether E is STO is NP-hard.
Journal title
Journal of Symbolic Computation
Serial Year
1994
Journal title
Journal of Symbolic Computation
Record number
805041
Link To Document