Incremental construction of the minimal model
Christopher John Hogger · 1990
Abstract There is a simple incremental method for constructing the minimal model of any definite program P. This method is not strictly an algorithm since, in the case where MM(P) is infinite, it may not complete the construction in a finite number of steps; however, the more steps we perform, the better the approximation. The method starts by choosing some interpretation I 1<;;;B(P). Later on we shall see that there is a preferred choice of I1 and that not all choices are adequate. Choosing I1 can be viewed as guessing which atoms have to be true in any model of P. Now consider any clause in G(P)