at.logic.gapt.proofs.resolution
Sometimes, we have a resolution refutation R of a set of clauses C and want a refutation R' of a set C' such that C implies C'.
This algorithm tries to obtain R' by trying to replace clauses c from C in R by derivations of C from C' in the following way:
If none of this works, we issue a warning and keep the clause c. If no warning is issued and the algorithm terminates, the result is the desired R'.
In general, if R is a derivation of a clause c, the result R' of fixDerivation(R) is a derivation of a subclause of c.
Sometimes, we have a resolution refutation R of a set of clauses C and want a refutation R' of a set C' such that C implies C'.
This algorithm tries to obtain R' by trying to replace clauses c from C in R by derivations of C from C' in the following way:
If none of this works, we issue a warning and keep the clause c. If no warning is issued and the algorithm terminates, the result is the desired R'.
In general, if R is a derivation of a clause c, the result R' of fixDerivation(R) is a derivation of a subclause of c.