Author： Otto F. Narendran P. Dougherty D.J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.198, Iss.1, 1998-05, pp. : 1-47
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
&unknown;&unknown; 5 -equational theory of context unification is undecidable
By Vorobyov S.
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :
By Cheney James
Journal of Automated Reasoning, Vol. 45, Iss. 3, 2010-10 ,pp. :
A combinatory logic approach to higher-order E-unification
Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. :
E-unification with Constants vs. General E-unification
By Otop Jan
Journal of Automated Reasoning, Vol. 48, Iss. 3, 2012-03 ,pp. :