The general singular Boolean networks are proposed in this study, motivated by the algebraic form of dynamicalgebraic Boolean networks via the semi-tensor product of matrices. First, one of the most important problems for this kind of networks, solvability problem, is discussed. Then, in order to calculate the fixed points and cycles, the transition matrix of a singular Boolean network is defined, which contains all the state transferring information. At last, the general singular Boolean control networks are considered with their solvability and the disturbance decoupling problem is presented and solved by a constant control. Illustrative examples are given to show the feasibility of the results.