充足可能性問題
There are several special cases of the Boolean satisfiability problem in which the formulas are required to have a particular structure. A "literal" is either a variable, called "positive literal", or the negation of a variable, called "negative literal".