THE UNIFICATION METHOD IN PROLOG SYSTEM
Iao H
Abstract
Iao H
Abstract
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Unification, Prolog, Computer science, Stack (abstract data type), Programming language, Theoretical computer science