Should calculate the same clause set as StandardClauseSet, but without the intermediate representation of a normalized struct.
Should calculate the same clause set as StandardClauseSet, but without the intermediate representation of a normalized struct. Does not work for Schema, for CERESomega only if all labels are empty (clauses are correct, but labels forgotten).
The idea here is that we use subsumption during clause set generation But take care, this clause set generation is incomplete! Take e.g.
The idea here is that we use subsumption during clause set generation But take care, this clause set generation is incomplete! Take e.g. S1 = :- F(x) < :-F(a) and S2 = :- G(x) < :- G(b) but S1 x S2 = :- F(x), G(x) does not subsume :- F(a), G(b). TODO: make a safe version (e.g. disjoint variables are safe)
This implements the clause set transformation of the original CERES method.
This implements the clause set transformation of the original CERES method. Does not work for Schema, for CERESomega only if all labels are empty.
This implements the standard clause set from Bruno's thesis.
This implements the standard clause set from Bruno's thesis. It has a computational drawback: we create the normalized struct first, which is later on converted to a clause set. The normalized struct easily becomes so big that recursive functions run out of stack. The AlternativeStandardClauseSet performs a direct conversion, which can handle bigger sizes.