Abstract
Abstract Abstract Let Var-SAT be the set of prepositional formulas which are satisfiable for any replacement of any set of literals by their complements. We discuss the complexity of Var-SAT . For 2-CNF -formulas we present a linear-time algorithm, and for DNF⩕ CNF -formulas we show the coNP —hardness of the problem Var-SAT . Further, we show that any satisfiable hitting formula and any proper subformula of a minimal unsatisfiable Horn-formula is in Var-SAT.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: 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.