Date of Original Version

1-1992

Type

Article

Abstract or Description

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.

DOI

10.1016/0020-0190(92)90098-G

Share

COinS
 

Published In

Information Processing Letters , 42, 2, 109-111.