AND-parallelism of Logic Programs Based on Compilation

This paper presents a method to execute logic programs in AND- parallelism based on static data analysis. A clause of logic programs is transformed into an execution graph expression through compilation With simple test at run-time, execution in AND-parallelism can be available. Sometimes the optimal AND-parallelism can not be gained with the method.