摘要
本文基于PROLOG 系统中A,B 栈计算模型,讨论了一致化问题,给出了关于替换和环境等数据结构的动态描述,并且给出了求一个目标的基例(ground instance)和一致化两个算法。一致化算法根据PROLOG 系统求解的要求得到基本的mgu(ground mostgeneral unifier)。在算法中应用了环境与结构共享技术,提高了效率。本文还给出了应用上述方法的计算实例。
This paper discusses the unification problem based on the computationmodel of stack A and stack B in a PROLOG system.The dynamic description of datastructure about substitution and environment is presented.Two algorithms of substitu-tion and unification are also given.According to the demand of the PROLOG system,the result of unification is ground most general unifior.In the algorithms,using environment and structure sharing techn logy,theefficioncy has been considerably promoted.
出处
《计算机应用与软件》
CSCD
1990年第3期8-12,共5页
Computer Applications and Software