A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In the present paper we study the complexity of some restricted versions of the satisfiability problem for propositional CNF formulas. We define these restrictions through their corresponding languages which are identified using the self-reducibility property of satisfiable propositional CNF formulas. The notion of kernel constructibility (similar to self-reducibility) and that of bandwidth are used to define these languages. The results throw some light on the structure of the satisfiabilitydoi:10.1016/0304-3975(89)90125-4 fatcat:tun2tknzbrbgzhokgfqdarpv6y