An Optimal Algorithm for Purging Regular Schemes

Abstract

In the following, we assume that sets of variables, basic statements, and selectors are given. Let us choose subsets of arguments A(s), results R(s), and obligatory results R’(s) $\subseteq$ R(s) in the set of variables for each basic statement s. For each selector c, we choose the set of its arguments A(c). The sets of results and obligatory results for selectors are considered to be empty. In addition, an arity ar(c) ∈ N is assigned to each selector c.