Abstract
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an expression while preserving its set of maximal models. We present an output-polynomial algorithm for the 2CNF case and we show that the problem cannot be solved in output-polynomial time in the case of Horn expressions, unless P= NP , despite an affinity of this case to the recently subexponentially solved transversal hypergraph problem. The problem is of course trivial for 1-valid and anti-Horn expressions, and open for exclusive-ors; it is NP-hard in all other cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
