Abstract
Propositional satisfiability (SAT) is a well-known NP-complete problem. We define a hierarchy Ω 0, Ω 1,… of classes of formulae such that for any class Ω k , SAT is solvable in O( n k + 1 ) time. The basic class Ω 0 contains all formulae in conjunctive normal form (CNF) where each conjunct is a Horn clause, and allformulae in CNF where each conjunct is a binary clause. This hierarchy improves upon the hierarchy defined by Gallo and Scutellá. We also present a sound and complete algorithm for solving SAT that takes time O( n k + 1 ) for any formula in the class Ω k .
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.
