The improvement of the and/or process model for parallel interpretation of logic programs

J.S.Conery has proposed the AND/OR process model for parallel interpretation of logic programs in [1,2]. In [3], N.S.Woo and K.M.Choe have showed that Conery's original algorithm [1,2] is not always correct. In order to correct this mistake, they have presented an algorithm for selecting the backtrack literal in the AND process, which exploits the AND parallelism in the AND/OR process model. In our this paper, we illustrate that Conery's model revised by Woo-Choe algorithm will do some vain work or infinite repeat in certain case. To avoid such vain or infinite work, we make some revision of the model. Our revision can improve the running efficiency of the model.