back_demod_indexed | back_demod_linear | index_clause_back_demod | rewritable_clause |
Plist back_demod_indexed(Clause demod, int type, Mindex idx);This routine returns a Plist: the set clauses that have terms that can be rewritten with Clause demod.
If demod is oriented, demodulation is assumed to be left-to-right. If demod is not oriented, either way is allowed.
The Plist which is returned is ordered by decreasing clause ID.
Plist back_demod_linear(Clause demod, Clist lst, Plist rewritables);This routine returns a Plist: the subset of Clist lst that can be rewritten with Clause demod (which is assumed to be an oriented equation). The Plist which is returned is ordered by decreasing clause ID.
void index_clause_back_demod(Clause c, Mindex idx, Indexop op);This routine indexes or unindexes an equation as a left-to-right demodulator.
BOOL rewritable_clause(Clause demod, Clause c);This Boolean function checks if Clause c is can be rewritten by Clause demod, which is assumed to be an oriented (left-to-right) equation.
These activities are projects of the Mathematics and Computer Science Division of Argonne National Laboratory.