Recognizing renamable generalized propositional Horn formulas is NP-complete

Reference:

T. Eiter, P. Kilpeläinen, and Heikki Mannila. Recognizing renamable generalized propositional horn formulas is np-complete. Discrete Applied Mathematics, 59:23–31, 1995.

Suggested BibTeX entry:

@article{ekmdam,
    author = {T. Eiter and P. Kilpel{\"a}inen and Heikki Mannila},
    journal = {Discrete Applied Mathematics},
    pages = {23-31},
    title = {Recognizing renamable generalized propositional Horn formulas is NP-complete},
    volume = {59},
    year = {1995},
}