Reenements for Restart Model Elimination Reenements for Restart Model Elimination

We introduce and discuss a number of reenements for restart model elimination (RME). Most of these reenements are motivated by the use of RME as an interpreter for disjunctive logic programming. Especially head selection function, computation rule, strictness and independence of the goal clause are motivated by aiming at a procedural interpretation of clauses. Other reene-ments like regularity and early cancellation pruning are techniques to handle the tremendous search space. We discuss these techniques and investigate their compatibility. As a new result we give a proof of completeness for RME with early cancellation pruning; we furthermore show that this powerful re-nement is compatibel with regularity tests.