Implementaion of a parallel subsumption algorithm (abstract only)


Many current automated theorem provers use a refutation procedure based on some version of the principle of resolution. These methods normally lead to the generation of large numbers of new clauses. Subsumption is a process that eliminates the superfluous clauses from the clause space, thus speeding up the proof. The research presented here is concerned… (More)
DOI: 10.1145/320599.322473