Non-horn clause logic programming without contrapositives
Journal of Automated Reasoning
Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
SLWV - A Theorem Prover for Logic Programming
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
{\bf (Revision of CS-1991-42.)} The Near-Horn Approach to Disjunctive Logic Programming
{\'bf (Revision of CS-1991-42.)} The Near-Horn Approach to Disjunctive Logic Programming
A Simple near-Horn Prolog Interpreter
A Simple near-Horn Prolog Interpreter
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
| Hi-index | 0.00 |
In this paper, 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 Plaisted's Modified Problem Reduction 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.