Lean clause-sets
KullmannOliver · Discrete Applied Mathematics · 2003
We study the problem of (efficiently) deleting such clauses from conjunctive normal forms (clause-sets) which cannot contribute to any proof of unsatisfiability. For that purpose we introduce the n...