Abstract

Logic programming consists of two main components (semantic and algorithm) in order to calculate the models from particular logic programs. Recently, there is not an algorithm for solving this problem completely. In this paper, we will present an extended algorithm for calculating models of general semantic in logic programming. The extended algorithm divides the originally program into subprograms, reduces, calculates subprogram models and then synthetize to the whole program models. It is based on fitting semantic, stable model semantic and “strongly connected components”.