Date of Original Version
1-1992
Type
Article
Published In
Information Processing Letters Volume 42, Issue 2, 11 May 1992, Pages 109-111
Abstract or Table of Contents
We show that the problem of finding a maximum renamable Horn problem within a propositional satisfiability problem is NP-hard but can be formulated as a set packing and therefore a maximum clique problem, for which numerous algorithms and heuristics have been developed.