HIGHLIGHTS
SUMMARY
Boolean connectives: Any Boolean function with one or two inputs and one output, such as ∧(AND), ∨(OR), ⇁(NOT), ⇒(implication), ⇔(if and only if); 3. and parentheses. The authors define a CN F Boolean formula using the following terms: A literal in a Boolean formula is an occurrence of a variable or its negation. The Boolean formula: (x1 ∨ ⇁ x1 ∨ ⇁ x2 ) ∧ (x3 ∨ x2 ∨ x4 ) ∧ (⇁ x1 ∨ ⇁ x3 ∨ ⇁ x4 ) is in 3CN F. The first of its three clauses is (x1 ∨ ⇁ x1 ∨ ⇁ x2 ), which contains the three literals x1, ⇁ x1, and ⇁ x2. NAE-3SAT consists in knowing whether . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.