Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete

Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila. Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. Discrete Applied Mathematics, 59(1):23-31, 1995. [doi]

Abstract

Abstract is missing.