Open Access. Powered by Scholars. Published by Universities.®
Public Affairs, Public Policy and Public Administration
Computational complexity; renamable Horn problems; satisfiability
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Detecting Embedded Horn Structure In Propositional Logic, V. Chandru, John N. Hooker
Detecting Embedded Horn Structure In Propositional Logic, V. Chandru, John N. Hooker
John Hooker
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.