Compilation of disjunctive logic programs using an extended WAM

We show that disjunctive logic programs can be efficiently compiled to an extended version of Warren´s Abstract Machine (WAM). In this compilation, we use D.A. Plaisted´s (1988) Modified Problem Reaction Format (MPRF) as the basic proof procedure. Compilation of disjunctive logic programs is done in two stages: 1) the axioms and proof rules of MPRF are used to convert the disjunctive logic program into an equivalent Prolog program; and 2) this Prolog program is compiled to a WAM that has been modified to support efficient implementation of the axioms and splitting rule of MPRF. The modified WAM´s design and some measurements of its performance are presented