Design And Implementation Of Inference Machine For G(?)del Compiler

Logic programming language provides a declarative program designing method and has several advantages compared with the algorithm-based programming language such as Pascal, Ada and C and so on. Firstly, logic program is suitable for expressing the problems in the area of artificial intelligence due to its ample expression ability and indeterminacy nature. Secondly, founded on the first predicate logic, logic program is provided with a strict maths background, which makes it easy to correct proving and validating. Finally, the logic language programmers have not to consider"how to compute"and only to specify"what to do", hence they can dedicate their energy to the solution of the problems and quest for the solution at the level of computing model. Because of the huge success of Prolog, Prolog is always considered as the alias of the logic program language. However, Prolog bases on the Horn subset of first predicate logic and is type-less, which makes its expression ability hard to satisfy the need of practice application. Moreover, it imports many process predicate, for example cut and retract and so on, which makes it lack of clear and definitive declaration semantic.According to above reasons, the researchers of logic programming language area propose the G(o|¨)del which inherits and develop the Prolog and try to solve the semantic problems of Prolog, boost up the its expression ability and shorten the large gap between the ideal and practice logic programming language. So it introduces the type system, increase the language elements such as delay computing, and can support the modular and metaprogram programming; it has flexible computing regulation and"commit"pruning operation and provide the mechanism to support the abstract data type programming through the system modulars. However, as a logic programming language, whether G(o|¨)del can achieve a big success is determined by the implementing of G(o|¨)del system. This paper shows a implementing scheme of G(o|¨)del realization system and mainly focuses on the implementing of the inference machine.In this article, we firstly discuss the effect of the main mechanism of G(o|¨)del such as type system, delay computing and pruning operation and so on. And then, we show the design idea of the G(o|¨)del realization system which is that the system firstly translates the source code of the G(o|¨)del program to high degree structural intermediate code and then carry through the reasoning based on the intermediate code. According to this idea we give the architecture of the compiler system and then we give the intermediate code structure and the implement method of the inference machine. Finally, through the performance analyzing, we prove our inference machine owning a good efficiency.