A high level compiling implementation of PARLOG based on extended graph rewriting
Li Zhenzhong, Wang Dingxing · [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence · 2002
An extended graph rewriting computational model is proposed which can implement logic variables, nondeterminism, OR-parallelism, and guard calls of PARLOG very efficiently. It is pointed out that the methods for implementing PARLOG based on this model are better than those in other related research works.>